30.39/12.63 YES 30.39/12.63 30.39/12.63 Ultimate: Cannot open display: 30.39/12.63 This is Ultimate 0.1.24-8dc7c08-m 30.39/12.63 [2019-03-28 12:40:45,833 INFO L170 SettingsManager]: Resetting all preferences to default values... 30.39/12.63 [2019-03-28 12:40:45,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 30.39/12.63 [2019-03-28 12:40:45,847 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 30.39/12.63 [2019-03-28 12:40:45,848 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 30.39/12.63 [2019-03-28 12:40:45,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 30.39/12.63 [2019-03-28 12:40:45,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 30.39/12.63 [2019-03-28 12:40:45,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 30.39/12.63 [2019-03-28 12:40:45,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 30.39/12.63 [2019-03-28 12:40:45,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,854 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 30.39/12.63 [2019-03-28 12:40:45,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 30.39/12.63 [2019-03-28 12:40:45,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 30.39/12.63 [2019-03-28 12:40:45,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 30.39/12.63 [2019-03-28 12:40:45,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 30.39/12.63 [2019-03-28 12:40:45,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 30.39/12.63 [2019-03-28 12:40:45,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 30.39/12.63 [2019-03-28 12:40:45,862 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 30.39/12.63 [2019-03-28 12:40:45,864 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 30.39/12.63 [2019-03-28 12:40:45,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 30.39/12.63 [2019-03-28 12:40:45,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 30.39/12.63 [2019-03-28 12:40:45,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 30.39/12.63 [2019-03-28 12:40:45,870 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 30.39/12.63 [2019-03-28 12:40:45,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 30.39/12.63 [2019-03-28 12:40:45,871 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 30.39/12.63 [2019-03-28 12:40:45,872 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 30.39/12.63 [2019-03-28 12:40:45,873 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 30.39/12.63 [2019-03-28 12:40:45,873 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 30.39/12.63 [2019-03-28 12:40:45,874 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 30.39/12.63 [2019-03-28 12:40:45,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 30.39/12.63 [2019-03-28 12:40:45,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 30.39/12.63 [2019-03-28 12:40:45,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 30.39/12.63 [2019-03-28 12:40:45,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 30.39/12.63 [2019-03-28 12:40:45,878 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 30.39/12.63 [2019-03-28 12:40:45,892 INFO L110 SettingsManager]: Loading preferences was successful 30.39/12.63 [2019-03-28 12:40:45,893 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 30.39/12.63 [2019-03-28 12:40:45,894 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 30.39/12.63 [2019-03-28 12:40:45,894 INFO L133 SettingsManager]: * Rewrite not-equals=true 30.39/12.63 [2019-03-28 12:40:45,894 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 30.39/12.63 [2019-03-28 12:40:45,894 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 30.39/12.63 [2019-03-28 12:40:45,894 INFO L133 SettingsManager]: * Use SBE=true 30.39/12.63 [2019-03-28 12:40:45,895 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 30.39/12.63 [2019-03-28 12:40:45,895 INFO L133 SettingsManager]: * Use old map elimination=false 30.39/12.63 [2019-03-28 12:40:45,895 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 30.39/12.63 [2019-03-28 12:40:45,895 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 30.39/12.63 [2019-03-28 12:40:45,895 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 30.39/12.63 [2019-03-28 12:40:45,895 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 30.39/12.63 [2019-03-28 12:40:45,896 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 30.39/12.63 [2019-03-28 12:40:45,896 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 30.39/12.63 [2019-03-28 12:40:45,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 30.39/12.63 [2019-03-28 12:40:45,896 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 30.39/12.63 [2019-03-28 12:40:45,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE 30.39/12.63 [2019-03-28 12:40:45,897 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 30.39/12.63 [2019-03-28 12:40:45,897 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 30.39/12.63 [2019-03-28 12:40:45,897 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 30.39/12.63 [2019-03-28 12:40:45,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 30.39/12.63 [2019-03-28 12:40:45,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 30.39/12.63 [2019-03-28 12:40:45,897 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 30.39/12.63 [2019-03-28 12:40:45,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.39/12.63 [2019-03-28 12:40:45,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 30.39/12.63 [2019-03-28 12:40:45,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 30.39/12.63 [2019-03-28 12:40:45,898 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 30.39/12.63 [2019-03-28 12:40:45,898 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 30.39/12.63 [2019-03-28 12:40:45,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 30.39/12.63 [2019-03-28 12:40:45,938 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 30.39/12.63 [2019-03-28 12:40:45,942 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 30.39/12.63 [2019-03-28 12:40:45,943 INFO L271 PluginConnector]: Initializing CDTParser... 30.39/12.63 [2019-03-28 12:40:45,944 INFO L276 PluginConnector]: CDTParser initialized 30.39/12.63 [2019-03-28 12:40:45,945 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 30.39/12.63 [2019-03-28 12:40:46,007 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/7b457a2a09664410804d0e9d7cea3604/FLAGb56e57735 30.39/12.63 [2019-03-28 12:40:46,370 INFO L307 CDTParser]: Found 1 translation units. 30.39/12.63 [2019-03-28 12:40:46,370 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 30.39/12.63 [2019-03-28 12:40:46,371 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 30.39/12.63 [2019-03-28 12:40:46,377 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/7b457a2a09664410804d0e9d7cea3604/FLAGb56e57735 30.39/12.63 [2019-03-28 12:40:46,760 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/7b457a2a09664410804d0e9d7cea3604 30.39/12.63 [2019-03-28 12:40:46,772 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 30.39/12.63 [2019-03-28 12:40:46,773 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 30.39/12.63 [2019-03-28 12:40:46,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 30.39/12.63 [2019-03-28 12:40:46,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 30.39/12.63 [2019-03-28 12:40:46,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 30.39/12.63 [2019-03-28 12:40:46,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:46" (1/1) ... 30.39/12.63 [2019-03-28 12:40:46,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525b0348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:46, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:46,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:46" (1/1) ... 30.39/12.63 [2019-03-28 12:40:46,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 30.39/12.63 [2019-03-28 12:40:46,812 INFO L176 MainTranslator]: Built tables and reachable declarations 30.39/12.63 [2019-03-28 12:40:46,985 INFO L206 PostProcessor]: Analyzing one entry point: main 30.39/12.63 [2019-03-28 12:40:46,997 INFO L191 MainTranslator]: Completed pre-run 30.39/12.63 [2019-03-28 12:40:47,078 INFO L206 PostProcessor]: Analyzing one entry point: main 30.39/12.63 [2019-03-28 12:40:47,095 INFO L195 MainTranslator]: Completed translation 30.39/12.63 [2019-03-28 12:40:47,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47 WrapperNode 30.39/12.63 [2019-03-28 12:40:47,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 30.39/12.63 [2019-03-28 12:40:47,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 30.39/12.63 [2019-03-28 12:40:47,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 30.39/12.63 [2019-03-28 12:40:47,097 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 30.39/12.63 [2019-03-28 12:40:47,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 30.39/12.63 [2019-03-28 12:40:47,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 30.39/12.63 [2019-03-28 12:40:47,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 30.39/12.63 [2019-03-28 12:40:47,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized 30.39/12.63 [2019-03-28 12:40:47,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 30.39/12.63 [2019-03-28 12:40:47,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 30.39/12.63 [2019-03-28 12:40:47,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... 30.39/12.63 [2019-03-28 12:40:47,166 INFO L276 PluginConnector]: RCFGBuilder initialized 30.39/12.63 [2019-03-28 12:40:47,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (1/1) ... 30.39/12.63 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.39/12.63 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 30.39/12.63 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 30.39/12.63 [2019-03-28 12:40:47,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 30.39/12.63 [2019-03-28 12:40:47,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 30.39/12.63 [2019-03-28 12:40:47,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 30.39/12.63 [2019-03-28 12:40:47,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 30.39/12.63 [2019-03-28 12:40:47,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 30.39/12.63 [2019-03-28 12:40:47,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 30.39/12.63 [2019-03-28 12:40:47,486 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 30.39/12.63 [2019-03-28 12:40:47,486 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 30.39/12.63 [2019-03-28 12:40:47,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:47 BoogieIcfgContainer 30.39/12.63 [2019-03-28 12:40:47,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 30.39/12.63 [2019-03-28 12:40:47,489 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 30.39/12.63 [2019-03-28 12:40:47,489 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 30.39/12.63 [2019-03-28 12:40:47,491 INFO L276 PluginConnector]: BlockEncodingV2 initialized 30.39/12.63 [2019-03-28 12:40:47,492 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:47" (1/1) ... 30.39/12.63 [2019-03-28 12:40:47,514 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges 30.39/12.63 [2019-03-28 12:40:47,515 INFO L258 BlockEncoder]: Using Remove infeasible edges 30.39/12.63 [2019-03-28 12:40:47,516 INFO L263 BlockEncoder]: Using Maximize final states 30.39/12.63 [2019-03-28 12:40:47,517 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 30.39/12.63 [2019-03-28 12:40:47,517 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 30.39/12.63 [2019-03-28 12:40:47,519 INFO L296 BlockEncoder]: Using Remove sink states 30.39/12.63 [2019-03-28 12:40:47,520 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 30.39/12.63 [2019-03-28 12:40:47,520 INFO L179 BlockEncoder]: Using Rewrite not-equals 30.39/12.63 [2019-03-28 12:40:47,544 INFO L185 BlockEncoder]: Using Use SBE 30.39/12.63 [2019-03-28 12:40:47,573 INFO L200 BlockEncoder]: SBE split 13 edges 30.39/12.63 [2019-03-28 12:40:47,578 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 30.39/12.63 [2019-03-28 12:40:47,580 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.39/12.63 [2019-03-28 12:40:47,609 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 30.39/12.63 [2019-03-28 12:40:47,612 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 30.39/12.63 [2019-03-28 12:40:47,613 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 30.39/12.63 [2019-03-28 12:40:47,614 INFO L71 MaximizeFinalStates]: 0 new accepting states 30.39/12.63 [2019-03-28 12:40:47,614 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 30.39/12.63 [2019-03-28 12:40:47,615 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 30.39/12.63 [2019-03-28 12:40:47,615 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges 30.39/12.63 [2019-03-28 12:40:47,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:47 BasicIcfg 30.39/12.63 [2019-03-28 12:40:47,616 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 30.39/12.63 [2019-03-28 12:40:47,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 30.39/12.63 [2019-03-28 12:40:47,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... 30.39/12.63 [2019-03-28 12:40:47,620 INFO L276 PluginConnector]: TraceAbstraction initialized 30.39/12.63 [2019-03-28 12:40:47,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:40:46" (1/4) ... 30.39/12.63 [2019-03-28 12:40:47,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c0dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:47, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:47,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (2/4) ... 30.39/12.63 [2019-03-28 12:40:47,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c0dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:47, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:47,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:47" (3/4) ... 30.39/12.63 [2019-03-28 12:40:47,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c0dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:47, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:47,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:47" (4/4) ... 30.39/12.63 [2019-03-28 12:40:47,625 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.39/12.63 [2019-03-28 12:40:47,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 30.39/12.63 [2019-03-28 12:40:47,645 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. 30.39/12.63 [2019-03-28 12:40:47,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. 30.39/12.63 [2019-03-28 12:40:47,691 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.39/12.63 [2019-03-28 12:40:47,692 INFO L382 AbstractCegarLoop]: Interprodecural is true 30.39/12.63 [2019-03-28 12:40:47,692 INFO L383 AbstractCegarLoop]: Hoare is true 30.39/12.63 [2019-03-28 12:40:47,692 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 30.39/12.63 [2019-03-28 12:40:47,693 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 30.39/12.63 [2019-03-28 12:40:47,693 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.39/12.63 [2019-03-28 12:40:47,693 INFO L387 AbstractCegarLoop]: Difference is false 30.39/12.63 [2019-03-28 12:40:47,693 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 30.39/12.63 [2019-03-28 12:40:47,693 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 30.39/12.63 [2019-03-28 12:40:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. 30.39/12.63 [2019-03-28 12:40:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 30.39/12.63 [2019-03-28 12:40:47,714 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:47,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:47,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash 851781916, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:47,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:47,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:47,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:47,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:47,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 30.39/12.63 [2019-03-28 12:40:47,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.39/12.63 [2019-03-28 12:40:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.39/12.63 [2019-03-28 12:40:47,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 30.39/12.63 [2019-03-28 12:40:47,949 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. 30.39/12.63 [2019-03-28 12:40:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:48,152 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. 30.39/12.63 [2019-03-28 12:40:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.39/12.63 [2019-03-28 12:40:48,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:48,167 INFO L225 Difference]: With dead ends: 40 30.39/12.63 [2019-03-28 12:40:48,168 INFO L226 Difference]: Without dead ends: 39 30.39/12.63 [2019-03-28 12:40:48,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.39/12.63 [2019-03-28 12:40:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 30.39/12.63 [2019-03-28 12:40:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. 30.39/12.63 [2019-03-28 12:40:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 30.39/12.63 [2019-03-28 12:40:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. 30.39/12.63 [2019-03-28 12:40:48,213 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:48,214 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. 30.39/12.63 [2019-03-28 12:40:48,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.39/12.63 [2019-03-28 12:40:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. 30.39/12.63 [2019-03-28 12:40:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 30.39/12.63 [2019-03-28 12:40:48,215 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:48,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:48,216 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash 851781917, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:48,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:48,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:48,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:48,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 30.39/12.63 [2019-03-28 12:40:48,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.39/12.63 [2019-03-28 12:40:48,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.39/12.63 [2019-03-28 12:40:48,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 30.39/12.63 [2019-03-28 12:40:48,267 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. 30.39/12.63 [2019-03-28 12:40:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:48,430 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. 30.39/12.63 [2019-03-28 12:40:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.39/12.63 [2019-03-28 12:40:48,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:48,455 INFO L225 Difference]: With dead ends: 50 30.39/12.63 [2019-03-28 12:40:48,455 INFO L226 Difference]: Without dead ends: 47 30.39/12.63 [2019-03-28 12:40:48,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.39/12.63 [2019-03-28 12:40:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 30.39/12.63 [2019-03-28 12:40:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. 30.39/12.63 [2019-03-28 12:40:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 30.39/12.63 [2019-03-28 12:40:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 67 transitions. 30.39/12.63 [2019-03-28 12:40:48,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 67 transitions. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:48,466 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 67 transitions. 30.39/12.63 [2019-03-28 12:40:48,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.39/12.63 [2019-03-28 12:40:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 67 transitions. 30.39/12.63 [2019-03-28 12:40:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 30.39/12.63 [2019-03-28 12:40:48,466 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:48,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:48,467 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash 851781914, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:48,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:48,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:48,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:48,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:48,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.39/12.63 [2019-03-28 12:40:48,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.39/12.63 [2019-03-28 12:40:48,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.39/12.63 [2019-03-28 12:40:48,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.39/12.63 [2019-03-28 12:40:48,499 INFO L87 Difference]: Start difference. First operand 34 states and 67 transitions. Second operand 3 states. 30.39/12.63 [2019-03-28 12:40:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:48,555 INFO L93 Difference]: Finished difference Result 34 states and 67 transitions. 30.39/12.63 [2019-03-28 12:40:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.39/12.63 [2019-03-28 12:40:48,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:48,559 INFO L225 Difference]: With dead ends: 34 30.39/12.63 [2019-03-28 12:40:48,559 INFO L226 Difference]: Without dead ends: 28 30.39/12.63 [2019-03-28 12:40:48,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.39/12.63 [2019-03-28 12:40:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 30.39/12.63 [2019-03-28 12:40:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 30.39/12.63 [2019-03-28 12:40:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 30.39/12.63 [2019-03-28 12:40:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. 30.39/12.63 [2019-03-28 12:40:48,566 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:48,566 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. 30.39/12.63 [2019-03-28 12:40:48,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.39/12.63 [2019-03-28 12:40:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. 30.39/12.63 [2019-03-28 12:40:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 30.39/12.63 [2019-03-28 12:40:48,567 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:48,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:48,568 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:48,568 INFO L82 PathProgramCache]: Analyzing trace with hash 851782130, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:48,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:48,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:48,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:48,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:48,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 30.39/12.63 [2019-03-28 12:40:48,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 30.39/12.63 [2019-03-28 12:40:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.39/12.63 [2019-03-28 12:40:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.39/12.63 [2019-03-28 12:40:48,594 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 3 states. 30.39/12.63 [2019-03-28 12:40:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:48,660 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. 30.39/12.63 [2019-03-28 12:40:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.39/12.63 [2019-03-28 12:40:48,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:48,662 INFO L225 Difference]: With dead ends: 49 30.39/12.63 [2019-03-28 12:40:48,662 INFO L226 Difference]: Without dead ends: 30 30.39/12.63 [2019-03-28 12:40:48,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.39/12.63 [2019-03-28 12:40:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 30.39/12.63 [2019-03-28 12:40:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 30.39/12.63 [2019-03-28 12:40:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 30.39/12.63 [2019-03-28 12:40:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. 30.39/12.63 [2019-03-28 12:40:48,669 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 6 30.39/12.63 [2019-03-28 12:40:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:48,669 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. 30.39/12.63 [2019-03-28 12:40:48,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 30.39/12.63 [2019-03-28 12:40:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. 30.39/12.63 [2019-03-28 12:40:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 30.39/12.63 [2019-03-28 12:40:48,670 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:48,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:48,670 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:48,671 INFO L82 PathProgramCache]: Analyzing trace with hash 635434233, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:48,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:48,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:48,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 30.39/12.63 [2019-03-28 12:40:48,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 30.39/12.63 [2019-03-28 12:40:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 30.39/12.63 [2019-03-28 12:40:48,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 30.39/12.63 [2019-03-28 12:40:48,738 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 5 states. 30.39/12.63 [2019-03-28 12:40:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:48,894 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. 30.39/12.63 [2019-03-28 12:40:48,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 30.39/12.63 [2019-03-28 12:40:48,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 30.39/12.63 [2019-03-28 12:40:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:48,895 INFO L225 Difference]: With dead ends: 49 30.39/12.63 [2019-03-28 12:40:48,895 INFO L226 Difference]: Without dead ends: 44 30.39/12.63 [2019-03-28 12:40:48,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 30.39/12.63 [2019-03-28 12:40:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 30.39/12.63 [2019-03-28 12:40:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. 30.39/12.63 [2019-03-28 12:40:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 30.39/12.63 [2019-03-28 12:40:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. 30.39/12.63 [2019-03-28 12:40:48,903 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 7 30.39/12.63 [2019-03-28 12:40:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:48,904 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. 30.39/12.63 [2019-03-28 12:40:48,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 30.39/12.63 [2019-03-28 12:40:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. 30.39/12.63 [2019-03-28 12:40:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 30.39/12.63 [2019-03-28 12:40:48,904 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:48,905 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:48,905 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1472327545, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:48,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:48,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:48,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:48,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.39/12.63 [2019-03-28 12:40:48,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.39/12.63 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.39/12.63 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.39/12.63 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.39/12.63 [2019-03-28 12:40:48,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:49,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:49,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 30.39/12.63 [2019-03-28 12:40:49,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 30.39/12.63 [2019-03-28 12:40:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 30.39/12.63 [2019-03-28 12:40:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 30.39/12.63 [2019-03-28 12:40:49,067 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand 7 states. 30.39/12.63 [2019-03-28 12:40:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:49,186 INFO L93 Difference]: Finished difference Result 76 states and 109 transitions. 30.39/12.63 [2019-03-28 12:40:49,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 30.39/12.63 [2019-03-28 12:40:49,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:49,188 INFO L225 Difference]: With dead ends: 76 30.39/12.63 [2019-03-28 12:40:49,188 INFO L226 Difference]: Without dead ends: 39 30.39/12.63 [2019-03-28 12:40:49,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 30.39/12.63 [2019-03-28 12:40:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 30.39/12.63 [2019-03-28 12:40:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. 30.39/12.63 [2019-03-28 12:40:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 30.39/12.63 [2019-03-28 12:40:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. 30.39/12.63 [2019-03-28 12:40:49,195 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:49,195 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. 30.39/12.63 [2019-03-28 12:40:49,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 30.39/12.63 [2019-03-28 12:40:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. 30.39/12.63 [2019-03-28 12:40:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 30.39/12.63 [2019-03-28 12:40:49,196 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:49,196 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:49,197 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:49,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1903912626, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:49,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:49,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:49,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 30.39/12.63 [2019-03-28 12:40:49,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 30.39/12.63 [2019-03-28 12:40:49,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 30.39/12.63 [2019-03-28 12:40:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 30.39/12.63 [2019-03-28 12:40:49,240 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 5 states. 30.39/12.63 [2019-03-28 12:40:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:49,326 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. 30.39/12.63 [2019-03-28 12:40:49,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.39/12.63 [2019-03-28 12:40:49,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:49,327 INFO L225 Difference]: With dead ends: 62 30.39/12.63 [2019-03-28 12:40:49,327 INFO L226 Difference]: Without dead ends: 59 30.39/12.63 [2019-03-28 12:40:49,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 30.39/12.63 [2019-03-28 12:40:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. 30.39/12.63 [2019-03-28 12:40:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. 30.39/12.63 [2019-03-28 12:40:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. 30.39/12.63 [2019-03-28 12:40:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. 30.39/12.63 [2019-03-28 12:40:49,336 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:49,336 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. 30.39/12.63 [2019-03-28 12:40:49,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 30.39/12.63 [2019-03-28 12:40:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. 30.39/12.63 [2019-03-28 12:40:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 30.39/12.63 [2019-03-28 12:40:49,337 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:49,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:49,338 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1903912625, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:49,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:49,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.39/12.63 [2019-03-28 12:40:49,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.39/12.63 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.39/12.63 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.39/12.63 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.39/12.63 [2019-03-28 12:40:49,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:49,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:49,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 30.39/12.63 [2019-03-28 12:40:49,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 30.39/12.63 [2019-03-28 12:40:49,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 30.39/12.63 [2019-03-28 12:40:49,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 30.39/12.63 [2019-03-28 12:40:49,474 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 7 states. 30.39/12.63 [2019-03-28 12:40:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:49,579 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. 30.39/12.63 [2019-03-28 12:40:49,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.39/12.63 [2019-03-28 12:40:49,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:49,580 INFO L225 Difference]: With dead ends: 66 30.39/12.63 [2019-03-28 12:40:49,581 INFO L226 Difference]: Without dead ends: 60 30.39/12.63 [2019-03-28 12:40:49,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 30.39/12.63 [2019-03-28 12:40:49,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. 30.39/12.63 [2019-03-28 12:40:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. 30.39/12.63 [2019-03-28 12:40:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 30.39/12.63 [2019-03-28 12:40:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. 30.39/12.63 [2019-03-28 12:40:49,588 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:49,589 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. 30.39/12.63 [2019-03-28 12:40:49,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 30.39/12.63 [2019-03-28 12:40:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. 30.39/12.63 [2019-03-28 12:40:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 30.39/12.63 [2019-03-28 12:40:49,590 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:49,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:49,590 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1903903725, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:49,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:49,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:49,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:49,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 30.39/12.63 [2019-03-28 12:40:49,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 30.39/12.63 [2019-03-28 12:40:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 30.39/12.63 [2019-03-28 12:40:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 30.39/12.63 [2019-03-28 12:40:49,643 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. 30.39/12.63 [2019-03-28 12:40:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:49,695 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. 30.39/12.63 [2019-03-28 12:40:49,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.39/12.63 [2019-03-28 12:40:49,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:49,697 INFO L225 Difference]: With dead ends: 43 30.39/12.63 [2019-03-28 12:40:49,697 INFO L226 Difference]: Without dead ends: 41 30.39/12.63 [2019-03-28 12:40:49,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 30.39/12.63 [2019-03-28 12:40:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 30.39/12.63 [2019-03-28 12:40:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. 30.39/12.63 [2019-03-28 12:40:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 30.39/12.63 [2019-03-28 12:40:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. 30.39/12.63 [2019-03-28 12:40:49,702 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 12 30.39/12.63 [2019-03-28 12:40:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:49,703 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. 30.39/12.63 [2019-03-28 12:40:49,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 30.39/12.63 [2019-03-28 12:40:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. 30.39/12.63 [2019-03-28 12:40:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 30.39/12.63 [2019-03-28 12:40:49,704 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:49,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:49,704 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:49,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1878796187, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:49,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:49,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.39/12.63 [2019-03-28 12:40:49,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.39/12.63 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.39/12.63 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.39/12.63 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.39/12.63 [2019-03-28 12:40:49,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:49,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:49,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 30.39/12.63 [2019-03-28 12:40:49,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 30.39/12.63 [2019-03-28 12:40:49,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 30.39/12.63 [2019-03-28 12:40:49,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 30.39/12.63 [2019-03-28 12:40:49,827 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 6 states. 30.39/12.63 [2019-03-28 12:40:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:49,901 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. 30.39/12.63 [2019-03-28 12:40:49,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 30.39/12.63 [2019-03-28 12:40:49,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 30.39/12.63 [2019-03-28 12:40:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:49,902 INFO L225 Difference]: With dead ends: 67 30.39/12.63 [2019-03-28 12:40:49,902 INFO L226 Difference]: Without dead ends: 49 30.39/12.63 [2019-03-28 12:40:49,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 30.39/12.63 [2019-03-28 12:40:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. 30.39/12.63 [2019-03-28 12:40:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. 30.39/12.63 [2019-03-28 12:40:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 30.39/12.63 [2019-03-28 12:40:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. 30.39/12.63 [2019-03-28 12:40:49,909 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 22 30.39/12.63 [2019-03-28 12:40:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:49,910 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. 30.39/12.63 [2019-03-28 12:40:49,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 30.39/12.63 [2019-03-28 12:40:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. 30.39/12.63 [2019-03-28 12:40:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 30.39/12.63 [2019-03-28 12:40:49,911 INFO L394 BasicCegarLoop]: Found error trace 30.39/12.63 [2019-03-28 12:40:49,911 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:49,911 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 30.39/12.63 [2019-03-28 12:40:49,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:49,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1703778447, now seen corresponding path program 2 times 30.39/12.63 [2019-03-28 12:40:49,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:49,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 30.39/12.63 [2019-03-28 12:40:49,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 30.39/12.63 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 30.39/12.63 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 30.39/12.63 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 30.39/12.63 [2019-03-28 12:40:49,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 30.39/12.63 [2019-03-28 12:40:50,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) 30.39/12.63 [2019-03-28 12:40:50,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:50,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:50,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:50,046 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 30.39/12.63 [2019-03-28 12:40:50,047 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 30.39/12.63 [2019-03-28 12:40:50,057 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 30.39/12.63 [2019-03-28 12:40:50,058 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 30.39/12.63 [2019-03-28 12:40:50,058 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 30.39/12.63 [2019-03-28 12:40:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:50,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:50,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 30.39/12.63 [2019-03-28 12:40:50,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 30.39/12.63 [2019-03-28 12:40:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 30.39/12.63 [2019-03-28 12:40:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 30.39/12.63 [2019-03-28 12:40:50,165 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. 30.39/12.63 [2019-03-28 12:40:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:50,244 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. 30.39/12.63 [2019-03-28 12:40:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 30.39/12.63 [2019-03-28 12:40:50,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 30.39/12.63 [2019-03-28 12:40:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 30.39/12.63 [2019-03-28 12:40:50,246 INFO L225 Difference]: With dead ends: 39 30.39/12.63 [2019-03-28 12:40:50,246 INFO L226 Difference]: Without dead ends: 0 30.39/12.63 [2019-03-28 12:40:50,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 30.39/12.63 [2019-03-28 12:40:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 30.39/12.63 [2019-03-28 12:40:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 30.39/12.63 [2019-03-28 12:40:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 30.39/12.63 [2019-03-28 12:40:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 30.39/12.63 [2019-03-28 12:40:50,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 30.39/12.63 [2019-03-28 12:40:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. 30.39/12.63 [2019-03-28 12:40:50,247 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 30.39/12.63 [2019-03-28 12:40:50,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 30.39/12.63 [2019-03-28 12:40:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 30.39/12.63 [2019-03-28 12:40:50,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 30.39/12.63 [2019-03-28 12:40:50,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 30.39/12.63 [2019-03-28 12:40:50,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 30.39/12.63 [2019-03-28 12:40:50,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 30.39/12.63 [2019-03-28 12:40:50,906 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 30.39/12.63 [2019-03-28 12:40:51,124 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 30.39/12.63 [2019-03-28 12:40:51,127 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,127 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,128 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 26 28) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,129 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 16) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,130 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 16) the Hoare annotation is: (and (exists ((ULTIMATE.start_main_~array_size~0 Int)) (and (<= (+ ULTIMATE.start_SelectionSort_~i~0 2) ULTIMATE.start_main_~array_size~0) (= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* 4 ULTIMATE.start_main_~array_size~0)))) (let ((.cse0 (<= (+ ULTIMATE.start_SelectionSort_~min~0 1) ULTIMATE.start_SelectionSort_~j~0)) (.cse2 (* 4 ULTIMATE.start_SelectionSort_~min~0)) (.cse5 (select |#length| ULTIMATE.start_SelectionSort_~a.base)) (.cse1 (<= 0 ULTIMATE.start_SelectionSort_~i~0)) (.cse3 (= ULTIMATE.start_SelectionSort_~a.offset 0)) (.cse4 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse6 (= (select |#valid| ULTIMATE.start_SelectionSort_~a.base) 1))) (or (and .cse0 .cse1 (<= 0 (+ ULTIMATE.start_SelectionSort_~a.offset .cse2)) .cse3 .cse4 (<= (+ ULTIMATE.start_SelectionSort_~a.offset .cse2 8) .cse5) .cse6) (and .cse0 (<= (+ ULTIMATE.start_SelectionSort_~a.offset .cse2 4) .cse5) .cse1 (<= 1 ULTIMATE.start_SelectionSort_~min~0) .cse3 .cse4 .cse6))) (<= (+ ULTIMATE.start_SelectionSort_~i~0 1) ULTIMATE.start_SelectionSort_~j~0) (exists ((ULTIMATE.start_main_~array_size~0 Int)) (and (= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_SelectionSort_~array_size ULTIMATE.start_main_~array_size~0)))) 30.39/12.63 [2019-03-28 12:40:51,130 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 12 16) no Hoare annotation was computed. 30.39/12.63 [2019-03-28 12:40:51,130 INFO L444 ceAbstractionStarter]: At program point L8-2(lines 8 21) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_SelectionSort_~a.offset 0)) (.cse6 (<= 1 ULTIMATE.start_main_~array_size~0)) (.cse7 (= (select |#valid| ULTIMATE.start_SelectionSort_~a.base) 1)) (.cse8 (* 4 ULTIMATE.start_SelectionSort_~min~0)) (.cse0 (select |#length| ULTIMATE.start_SelectionSort_~a.base))) (let ((.cse1 (<= (+ ULTIMATE.start_SelectionSort_~a.offset .cse8 4) .cse0)) (.cse3 (and (<= (+ ULTIMATE.start_SelectionSort_~min~0 1) ULTIMATE.start_SelectionSort_~j~0) (<= 0 ULTIMATE.start_SelectionSort_~i~0) (<= (* 4 ULTIMATE.start_SelectionSort_~array_size) .cse0) (<= 0 (+ ULTIMATE.start_SelectionSort_~a.offset .cse8)) .cse5 .cse6 .cse7)) (.cse2 (exists ((ULTIMATE.start_main_~array_size~0 Int)) (and (= (select |#length| ULTIMATE.start_SelectionSort_~a.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_SelectionSort_~array_size ULTIMATE.start_main_~array_size~0))))) (or (and (<= (+ (* 4 ULTIMATE.start_SelectionSort_~i~0) ULTIMATE.start_SelectionSort_~a.offset 4) .cse0) .cse1 .cse2 .cse3) (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~i~0 1))) (and (<= ULTIMATE.start_SelectionSort_~array_size .cse4) .cse1 (<= ULTIMATE.start_SelectionSort_~j~0 .cse4) .cse3)) (and (= 0 ULTIMATE.start_SelectionSort_~i~0) (<= 4 .cse0) .cse5 .cse6 .cse2 .cse7)))) 30.39/12.63 [2019-03-28 12:40:51,131 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 30.39/12.63 [2019-03-28 12:40:51,139 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,145 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,145 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,145 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.63 [2019-03-28 12:40:51,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:51,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:51 BasicIcfg 30.39/12.63 [2019-03-28 12:40:51,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 30.39/12.63 [2019-03-28 12:40:51,167 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 30.39/12.63 [2019-03-28 12:40:51,167 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 30.39/12.63 [2019-03-28 12:40:51,172 INFO L276 PluginConnector]: BuchiAutomizer initialized 30.39/12.63 [2019-03-28 12:40:51,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.39/12.63 [2019-03-28 12:40:51,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:40:46" (1/5) ... 30.39/12.63 [2019-03-28 12:40:51,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5934413e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:51, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:51,174 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.39/12.63 [2019-03-28 12:40:51,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:47" (2/5) ... 30.39/12.63 [2019-03-28 12:40:51,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5934413e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:51, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:51,174 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.39/12.63 [2019-03-28 12:40:51,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:47" (3/5) ... 30.39/12.63 [2019-03-28 12:40:51,175 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5934413e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:51, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:51,175 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.39/12.63 [2019-03-28 12:40:51,175 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:47" (4/5) ... 30.39/12.63 [2019-03-28 12:40:51,175 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5934413e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:51, skipping insertion in model container 30.39/12.63 [2019-03-28 12:40:51,175 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 30.39/12.63 [2019-03-28 12:40:51,176 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:51" (5/5) ... 30.39/12.63 [2019-03-28 12:40:51,177 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 30.39/12.63 [2019-03-28 12:40:51,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation 30.39/12.63 [2019-03-28 12:40:51,199 INFO L374 BuchiCegarLoop]: Interprodecural is true 30.39/12.63 [2019-03-28 12:40:51,199 INFO L375 BuchiCegarLoop]: Hoare is true 30.39/12.63 [2019-03-28 12:40:51,199 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 30.39/12.63 [2019-03-28 12:40:51,199 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 30.39/12.63 [2019-03-28 12:40:51,199 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 30.39/12.63 [2019-03-28 12:40:51,200 INFO L379 BuchiCegarLoop]: Difference is false 30.39/12.63 [2019-03-28 12:40:51,200 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 30.39/12.63 [2019-03-28 12:40:51,200 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 30.39/12.63 [2019-03-28 12:40:51,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. 30.39/12.63 [2019-03-28 12:40:51,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 30.39/12.63 [2019-03-28 12:40:51,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.39/12.63 [2019-03-28 12:40:51,208 INFO L119 BuchiIsEmpty]: Starting construction of run 30.39/12.63 [2019-03-28 12:40:51,212 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 30.39/12.63 [2019-03-28 12:40:51,213 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:51,213 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 30.39/12.63 [2019-03-28 12:40:51,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. 30.39/12.63 [2019-03-28 12:40:51,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 30.39/12.63 [2019-03-28 12:40:51,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.39/12.63 [2019-03-28 12:40:51,214 INFO L119 BuchiIsEmpty]: Starting construction of run 30.39/12.63 [2019-03-28 12:40:51,215 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 30.39/12.63 [2019-03-28 12:40:51,215 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:51,220 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [146] ULTIMATE.startENTRY-->L26: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 15#L26true [103] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 26#L26-2true [121] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 16#L8-2true 30.39/12.63 [2019-03-28 12:40:51,220 INFO L796 eck$LassoCheckResult]: Loop: 16#L8-2true [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 20#L12-3true [106] L12-3-->L12-4: Formula: (>= v_ULTIMATE.start_SelectionSort_~j~0_4 v_ULTIMATE.start_SelectionSort_~array_size_5) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} AuxVars[] AssignedVars[] 18#L12-4true [149] L12-4-->L19: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_14))) (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1))) (and (= v_ULTIMATE.start_SelectionSort_~temp~0_5 (select (select |v_#memory_int_9| v_ULTIMATE.start_SelectionSort_~a.base_21) .cse0)) (<= (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1 4) (select |v_#length_15| v_ULTIMATE.start_SelectionSort_~a.base_21)) (<= 0 .cse0) (= 1 (select |v_#valid_25| v_ULTIMATE.start_SelectionSort_~a.base_21))))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_5, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~mem4] 19#L19true [94] L19-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_SelectionSort_~a.base_12)) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_SelectionSort_~a.base_12)) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_SelectionSort_~a.base_12) .cse1) |v_ULTIMATE.start_SelectionSort_#t~mem5_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5] 17#L19-1true [151] L19-1-->L20: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_16))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_SelectionSort_~a.base_22)) (<= 0 .cse1) (= 1 (select |v_#valid_28| v_ULTIMATE.start_SelectionSort_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22) .cse1 |v_ULTIMATE.start_SelectionSort_#t~mem5_6|)) |v_#memory_int_10|)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_6|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5, #memory_int] 8#L20true [152] L20-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_11))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_SelectionSort_~a.base_23)) (= v_ULTIMATE.start_SelectionSort_~i~0_17 (+ v_ULTIMATE.start_SelectionSort_~i~0_18 1)) (<= 0 .cse1) (= (store |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23 (store (select |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23) .cse1 v_ULTIMATE.start_SelectionSort_~temp~0_6)) |v_#memory_int_12|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_SelectionSort_~a.base_23))))) InVars {ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_18, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_4|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_17, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~i~0, #memory_int] 16#L8-2true 30.39/12.63 [2019-03-28 12:40:51,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:51,221 INFO L82 PathProgramCache]: Analyzing trace with hash 173411, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:51,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:51,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash -842929377, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:51,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:51,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:51,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 30.39/12.63 [2019-03-28 12:40:51,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 30.39/12.63 [2019-03-28 12:40:51,263 INFO L811 eck$LassoCheckResult]: loop already infeasible 30.39/12.63 [2019-03-28 12:40:51,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 30.39/12.63 [2019-03-28 12:40:51,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 30.39/12.63 [2019-03-28 12:40:51,265 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. 30.39/12.63 [2019-03-28 12:40:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 30.39/12.63 [2019-03-28 12:40:51,322 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. 30.39/12.63 [2019-03-28 12:40:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 30.39/12.63 [2019-03-28 12:40:51,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 42 transitions. 30.39/12.63 [2019-03-28 12:40:51,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 30.39/12.63 [2019-03-28 12:40:51,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 30.39/12.63 [2019-03-28 12:40:51,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 30.39/12.63 [2019-03-28 12:40:51,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.39/12.63 [2019-03-28 12:40:51,329 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 30.39/12.63 [2019-03-28 12:40:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 30.39/12.63 [2019-03-28 12:40:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,332 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,332 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,332 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 30.39/12.63 [2019-03-28 12:40:51,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. 30.39/12.63 [2019-03-28 12:40:51,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 30.39/12.63 [2019-03-28 12:40:51,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.39/12.63 [2019-03-28 12:40:51,333 INFO L119 BuchiIsEmpty]: Starting construction of run 30.39/12.63 [2019-03-28 12:40:51,333 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 30.39/12.63 [2019-03-28 12:40:51,333 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:51,334 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY [146] ULTIMATE.startENTRY-->L26: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 60#L26 [103] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 61#L26-2 [121] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 62#L8-2 30.39/12.63 [2019-03-28 12:40:51,335 INFO L796 eck$LassoCheckResult]: Loop: 62#L8-2 [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 63#L12-3 [99] L12-3-->L14: Formula: (< v_ULTIMATE.start_SelectionSort_~j~0_5 v_ULTIMATE.start_SelectionSort_~array_size_6) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} AuxVars[] AssignedVars[] 68#L14 [79] L14-->L14-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~j~0_6))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_SelectionSort_~a.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3 4) (select |v_#length_3| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= 0 .cse0)))) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem2] 73#L14-1 [75] L14-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_4))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_SelectionSort_~a.base_6) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5 4) (select |v_#length_5| v_ULTIMATE.start_SelectionSort_~a.base_6)) (<= 0 .cse0) (= (select |v_#valid_7| v_ULTIMATE.start_SelectionSort_~a.base_6) 1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_2|, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3] 72#L14-2 [115] L14-2-->L12-2: Formula: (>= |v_ULTIMATE.start_SelectionSort_#t~mem2_6| |v_ULTIMATE.start_SelectionSort_#t~mem3_6|) InVars {ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_6|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_6|} OutVars{ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_5|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_SelectionSort_#t~mem2] 69#L12-2 [72] L12-2-->L12-3: Formula: (= v_ULTIMATE.start_SelectionSort_~j~0_9 (+ v_ULTIMATE.start_SelectionSort_~j~0_10 1)) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_10} OutVars{ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_2|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0] 70#L12-3 [106] L12-3-->L12-4: Formula: (>= v_ULTIMATE.start_SelectionSort_~j~0_4 v_ULTIMATE.start_SelectionSort_~array_size_5) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} AuxVars[] AssignedVars[] 66#L12-4 [149] L12-4-->L19: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_14))) (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1))) (and (= v_ULTIMATE.start_SelectionSort_~temp~0_5 (select (select |v_#memory_int_9| v_ULTIMATE.start_SelectionSort_~a.base_21) .cse0)) (<= (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1 4) (select |v_#length_15| v_ULTIMATE.start_SelectionSort_~a.base_21)) (<= 0 .cse0) (= 1 (select |v_#valid_25| v_ULTIMATE.start_SelectionSort_~a.base_21))))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_5, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~mem4] 67#L19 [94] L19-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_SelectionSort_~a.base_12)) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_SelectionSort_~a.base_12)) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_SelectionSort_~a.base_12) .cse1) |v_ULTIMATE.start_SelectionSort_#t~mem5_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5] 64#L19-1 [151] L19-1-->L20: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_16))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_SelectionSort_~a.base_22)) (<= 0 .cse1) (= 1 (select |v_#valid_28| v_ULTIMATE.start_SelectionSort_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22) .cse1 |v_ULTIMATE.start_SelectionSort_#t~mem5_6|)) |v_#memory_int_10|)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_6|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5, #memory_int] 65#L20 [152] L20-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_11))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_SelectionSort_~a.base_23)) (= v_ULTIMATE.start_SelectionSort_~i~0_17 (+ v_ULTIMATE.start_SelectionSort_~i~0_18 1)) (<= 0 .cse1) (= (store |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23 (store (select |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23) .cse1 v_ULTIMATE.start_SelectionSort_~temp~0_6)) |v_#memory_int_12|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_SelectionSort_~a.base_23))))) InVars {ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_18, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_4|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_17, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~i~0, #memory_int] 62#L8-2 30.39/12.63 [2019-03-28 12:40:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash 173411, now seen corresponding path program 2 times 30.39/12.63 [2019-03-28 12:40:51,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:51,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash -110670539, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:51,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:51,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:51,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1245915501, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:51,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:51,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:51,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:51,526 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 30.39/12.63 [2019-03-28 12:40:51,646 INFO L216 LassoAnalysis]: Preferences: 30.39/12.63 [2019-03-28 12:40:51,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.39/12.63 [2019-03-28 12:40:51,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.39/12.63 [2019-03-28 12:40:51,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.39/12.63 [2019-03-28 12:40:51,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.39/12.63 [2019-03-28 12:40:51,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.39/12.63 [2019-03-28 12:40:51,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.39/12.63 [2019-03-28 12:40:51,648 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.39/12.63 [2019-03-28 12:40:51,649 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 30.39/12.63 [2019-03-28 12:40:51,649 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.39/12.63 [2019-03-28 12:40:51,649 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.39/12.63 [2019-03-28 12:40:51,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:51,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:52,124 INFO L300 LassoAnalysis]: Preprocessing complete. 30.39/12.63 [2019-03-28 12:40:52,130 INFO L497 LassoAnalysis]: Using template 'affine'. 30.39/12.63 [2019-03-28 12:40:52,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:52,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:52,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:52,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:52,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:52,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:52,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:52,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:52,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:52,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:52,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:52,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:52,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:52,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:52,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:52,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:52,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:52,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:52,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:52,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:52,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:52,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:52,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:52,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:52,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:52,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.39/12.63 [2019-03-28 12:40:52,253 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 30.39/12.63 [2019-03-28 12:40:52,254 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. 30.39/12.63 [2019-03-28 12:40:52,256 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.39/12.63 [2019-03-28 12:40:52,258 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 30.39/12.63 [2019-03-28 12:40:52,258 INFO L518 LassoAnalysis]: Proved termination. 30.39/12.63 [2019-03-28 12:40:52,259 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.39/12.63 Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_~i~0) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 - 1*ULTIMATE.start_SelectionSort_~a.offset - 4*ULTIMATE.start_SelectionSort_~i~0 30.39/12.63 Supporting invariants [] 30.39/12.63 [2019-03-28 12:40:52,271 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 30.39/12.63 [2019-03-28 12:40:52,274 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.63 [2019-03-28 12:40:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:52,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:52,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:52,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:52,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:52,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:52,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:52,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:52,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:52,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:52,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:52,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:52,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:52,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:52,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:52,712 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 30.39/12.63 [2019-03-28 12:40:52,717 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 30.39/12.63 [2019-03-28 12:40:52,718 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. 30.39/12.63 [2019-03-28 12:40:52,829 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 38 states and 47 transitions. Complement of second has 6 states. 30.39/12.63 [2019-03-28 12:40:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 30.39/12.63 [2019-03-28 12:40:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.39/12.63 [2019-03-28 12:40:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. 30.39/12.63 [2019-03-28 12:40:52,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 11 letters. 30.39/12.63 [2019-03-28 12:40:52,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.63 [2019-03-28 12:40:52,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 11 letters. 30.39/12.63 [2019-03-28 12:40:52,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.63 [2019-03-28 12:40:52,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 22 letters. 30.39/12.63 [2019-03-28 12:40:52,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.63 [2019-03-28 12:40:52,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. 30.39/12.63 [2019-03-28 12:40:52,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 30.39/12.63 [2019-03-28 12:40:52,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 43 transitions. 30.39/12.63 [2019-03-28 12:40:52,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 30.39/12.63 [2019-03-28 12:40:52,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 30.39/12.63 [2019-03-28 12:40:52,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. 30.39/12.63 [2019-03-28 12:40:52,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.39/12.63 [2019-03-28 12:40:52,843 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. 30.39/12.63 [2019-03-28 12:40:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. 30.39/12.63 [2019-03-28 12:40:52,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. 30.39/12.63 [2019-03-28 12:40:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 30.39/12.63 [2019-03-28 12:40:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. 30.39/12.63 [2019-03-28 12:40:52,846 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. 30.39/12.63 [2019-03-28 12:40:52,846 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. 30.39/12.63 [2019-03-28 12:40:52,846 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 30.39/12.63 [2019-03-28 12:40:52,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. 30.39/12.63 [2019-03-28 12:40:52,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 30.39/12.63 [2019-03-28 12:40:52,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.39/12.63 [2019-03-28 12:40:52,847 INFO L119 BuchiIsEmpty]: Starting construction of run 30.39/12.63 [2019-03-28 12:40:52,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 30.39/12.63 [2019-03-28 12:40:52,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:52,848 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY [146] ULTIMATE.startENTRY-->L26: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 350#L26 [103] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 351#L26-2 [120] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 352#L8-2 30.39/12.63 [2019-03-28 12:40:52,849 INFO L796 eck$LassoCheckResult]: Loop: 352#L8-2 [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 353#L12-3 [99] L12-3-->L14: Formula: (< v_ULTIMATE.start_SelectionSort_~j~0_5 v_ULTIMATE.start_SelectionSort_~array_size_6) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} AuxVars[] AssignedVars[] 379#L14 [79] L14-->L14-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~j~0_6))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_SelectionSort_~a.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3 4) (select |v_#length_3| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= 0 .cse0)))) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem2] 373#L14-1 [75] L14-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_4))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_SelectionSort_~a.base_6) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5 4) (select |v_#length_5| v_ULTIMATE.start_SelectionSort_~a.base_6)) (<= 0 .cse0) (= (select |v_#valid_7| v_ULTIMATE.start_SelectionSort_~a.base_6) 1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_2|, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3] 374#L14-2 [115] L14-2-->L12-2: Formula: (>= |v_ULTIMATE.start_SelectionSort_#t~mem2_6| |v_ULTIMATE.start_SelectionSort_#t~mem3_6|) InVars {ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_6|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_6|} OutVars{ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_5|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_SelectionSort_#t~mem2] 380#L12-2 [72] L12-2-->L12-3: Formula: (= v_ULTIMATE.start_SelectionSort_~j~0_9 (+ v_ULTIMATE.start_SelectionSort_~j~0_10 1)) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_10} OutVars{ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_2|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0] 378#L12-3 [106] L12-3-->L12-4: Formula: (>= v_ULTIMATE.start_SelectionSort_~j~0_4 v_ULTIMATE.start_SelectionSort_~array_size_5) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_4, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_5} AuxVars[] AssignedVars[] 361#L12-4 [149] L12-4-->L19: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_14))) (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1))) (and (= v_ULTIMATE.start_SelectionSort_~temp~0_5 (select (select |v_#memory_int_9| v_ULTIMATE.start_SelectionSort_~a.base_21) .cse0)) (<= (+ v_ULTIMATE.start_SelectionSort_~a.offset_15 .cse1 4) (select |v_#length_15| v_ULTIMATE.start_SelectionSort_~a.base_21)) (<= 0 .cse0) (= 1 (select |v_#valid_25| v_ULTIMATE.start_SelectionSort_~a.base_21))))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_5, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_21, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_15, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~mem4] 362#L19 [94] L19-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9))) (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_SelectionSort_~a.base_12)) (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_9 4) (select |v_#length_9| v_ULTIMATE.start_SelectionSort_~a.base_12)) (= (select (select |v_#memory_int_4| v_ULTIMATE.start_SelectionSort_~a.base_12) .cse1) |v_ULTIMATE.start_SelectionSort_#t~mem5_2|) (<= 0 .cse1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_12, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_2|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_9, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_7, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5] 357#L19-1 [151] L19-1-->L20: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~i~0_16))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_16 4) (select |v_#length_16| v_ULTIMATE.start_SelectionSort_~a.base_22)) (<= 0 .cse1) (= 1 (select |v_#valid_28| v_ULTIMATE.start_SelectionSort_~a.base_22)) (= (store |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22 (store (select |v_#memory_int_11| v_ULTIMATE.start_SelectionSort_~a.base_22) .cse1 |v_ULTIMATE.start_SelectionSort_#t~mem5_6|)) |v_#memory_int_10|)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_6|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_16|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_22, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_5|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_16, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem5, #memory_int] 358#L20 [152] L20-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_11))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17))) (and (<= (+ .cse0 v_ULTIMATE.start_SelectionSort_~a.offset_17 4) (select |v_#length_17| v_ULTIMATE.start_SelectionSort_~a.base_23)) (= v_ULTIMATE.start_SelectionSort_~i~0_17 (+ v_ULTIMATE.start_SelectionSort_~i~0_18 1)) (<= 0 .cse1) (= (store |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23 (store (select |v_#memory_int_13| v_ULTIMATE.start_SelectionSort_~a.base_23) .cse1 v_ULTIMATE.start_SelectionSort_~temp~0_6)) |v_#memory_int_12|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_SelectionSort_~a.base_23))))) InVars {ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_18, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} OutVars{ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_6, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_4|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_23, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_17, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_17, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_11, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~i~0, #memory_int] 352#L8-2 30.39/12.63 [2019-03-28 12:40:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash 173410, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:52,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:52,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash -110670539, now seen corresponding path program 2 times 30.39/12.63 [2019-03-28 12:40:52,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:52,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:52,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1374998220, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:52,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:53,017 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 30.39/12.63 [2019-03-28 12:40:53,125 INFO L216 LassoAnalysis]: Preferences: 30.39/12.63 [2019-03-28 12:40:53,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.39/12.63 [2019-03-28 12:40:53,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.39/12.63 [2019-03-28 12:40:53,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.39/12.63 [2019-03-28 12:40:53,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.39/12.63 [2019-03-28 12:40:53,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.39/12.63 [2019-03-28 12:40:53,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.39/12.63 [2019-03-28 12:40:53,127 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.39/12.63 [2019-03-28 12:40:53,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 30.39/12.63 [2019-03-28 12:40:53,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.39/12.63 [2019-03-28 12:40:53,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.39/12.63 [2019-03-28 12:40:53,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:53,555 INFO L300 LassoAnalysis]: Preprocessing complete. 30.39/12.63 [2019-03-28 12:40:53,555 INFO L497 LassoAnalysis]: Using template 'affine'. 30.39/12.63 [2019-03-28 12:40:53,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:53,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:53,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:53,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:53,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:53,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:53,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:53,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:53,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:53,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.39/12.63 [2019-03-28 12:40:53,662 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 30.39/12.63 [2019-03-28 12:40:53,663 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. 30.39/12.63 [2019-03-28 12:40:53,663 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.39/12.63 [2019-03-28 12:40:53,664 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 30.39/12.63 [2019-03-28 12:40:53,665 INFO L518 LassoAnalysis]: Proved termination. 30.39/12.63 [2019-03-28 12:40:53,665 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.39/12.63 Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~i~0) = 1*ULTIMATE.start_SelectionSort_~array_size - 1*ULTIMATE.start_SelectionSort_~i~0 30.39/12.63 Supporting invariants [] 30.39/12.63 [2019-03-28 12:40:53,675 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 30.39/12.63 [2019-03-28 12:40:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:53,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:53,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:53,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:53,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 30.39/12.63 [2019-03-28 12:40:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:53,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:53,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:53,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:53,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:53,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:53,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.63 [2019-03-28 12:40:53,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.63 [2019-03-28 12:40:53,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.63 [2019-03-28 12:40:53,837 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 30.39/12.63 [2019-03-28 12:40:53,837 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 30.39/12.63 [2019-03-28 12:40:53,838 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. 30.39/12.63 [2019-03-28 12:40:53,872 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 54 transitions. Complement of second has 4 states. 30.39/12.63 [2019-03-28 12:40:53,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 30.39/12.63 [2019-03-28 12:40:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 30.39/12.63 [2019-03-28 12:40:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. 30.39/12.63 [2019-03-28 12:40:53,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 11 letters. 30.39/12.63 [2019-03-28 12:40:53,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.63 [2019-03-28 12:40:53,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 14 letters. Loop has 11 letters. 30.39/12.63 [2019-03-28 12:40:53,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.63 [2019-03-28 12:40:53,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 22 letters. 30.39/12.63 [2019-03-28 12:40:53,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.63 [2019-03-28 12:40:53,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. 30.39/12.63 [2019-03-28 12:40:53,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 30.39/12.63 [2019-03-28 12:40:53,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 50 transitions. 30.39/12.63 [2019-03-28 12:40:53,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 30.39/12.63 [2019-03-28 12:40:53,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 30.39/12.63 [2019-03-28 12:40:53,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. 30.39/12.63 [2019-03-28 12:40:53,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 30.39/12.63 [2019-03-28 12:40:53,883 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. 30.39/12.63 [2019-03-28 12:40:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. 30.39/12.63 [2019-03-28 12:40:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 20. 30.39/12.63 [2019-03-28 12:40:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 30.39/12.63 [2019-03-28 12:40:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. 30.39/12.63 [2019-03-28 12:40:53,885 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 30.39/12.63 [2019-03-28 12:40:53,885 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 30.39/12.63 [2019-03-28 12:40:53,885 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 30.39/12.63 [2019-03-28 12:40:53,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. 30.39/12.63 [2019-03-28 12:40:53,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 30.39/12.63 [2019-03-28 12:40:53,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 30.39/12.63 [2019-03-28 12:40:53,886 INFO L119 BuchiIsEmpty]: Starting construction of run 30.39/12.63 [2019-03-28 12:40:53,887 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:53,887 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 30.39/12.63 [2019-03-28 12:40:53,887 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY [146] ULTIMATE.startENTRY-->L26: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 624#L26 [103] L26-->L26-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 625#L26-2 [121] L26-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= |v_ULTIMATE.start_SelectionSort_#in~a.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= |v_ULTIMATE.start_SelectionSort_#in~a.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_SelectionSort_~a.base_1 |v_ULTIMATE.start_SelectionSort_#in~a.base_1|) (= v_ULTIMATE.start_SelectionSort_~i~0_1 0) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_SelectionSort_~array_size_1 |v_ULTIMATE.start_SelectionSort_#in~array_size_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= |v_ULTIMATE.start_SelectionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0) (= v_ULTIMATE.start_SelectionSort_~a.offset_1 |v_ULTIMATE.start_SelectionSort_#in~a.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_1, ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_1|, ULTIMATE.start_SelectionSort_#t~pre0=|v_ULTIMATE.start_SelectionSort_#t~pre0_1|, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_1, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_1, ULTIMATE.start_SelectionSort_#t~mem5=|v_ULTIMATE.start_SelectionSort_#t~mem5_1|, ULTIMATE.start_SelectionSort_#t~mem4=|v_ULTIMATE.start_SelectionSort_#t~mem4_1|, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_1|, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_1|, ULTIMATE.start_SelectionSort_#in~array_size=|v_ULTIMATE.start_SelectionSort_#in~array_size_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_1, ULTIMATE.start_SelectionSort_#in~a.offset=|v_ULTIMATE.start_SelectionSort_#in~a.offset_1|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, ULTIMATE.start_SelectionSort_#in~a.base=|v_ULTIMATE.start_SelectionSort_#in~a.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~min~0, ULTIMATE.start_SelectionSort_#in~a.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_#t~pre0, ULTIMATE.start_SelectionSort_~a.base, ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_#t~mem5, ULTIMATE.start_SelectionSort_#t~mem4, ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_SelectionSort_#t~mem2, #valid, ULTIMATE.start_main_~numbers~0.offset, ULTIMATE.start_SelectionSort_#in~array_size, #length, ULTIMATE.start_SelectionSort_#in~a.base] 626#L8-2 [86] L8-2-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start_SelectionSort_~i~0_5 1))) (and (< .cse0 v_ULTIMATE.start_SelectionSort_~array_size_4) (= v_ULTIMATE.start_SelectionSort_~min~0_2 v_ULTIMATE.start_SelectionSort_~i~0_5) (= v_ULTIMATE.start_SelectionSort_~j~0_2 .cse0))) InVars {ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_2, ULTIMATE.start_SelectionSort_~temp~0=v_ULTIMATE.start_SelectionSort_~temp~0_2, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_4, ULTIMATE.start_SelectionSort_~i~0=v_ULTIMATE.start_SelectionSort_~i~0_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_2} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~temp~0, ULTIMATE.start_SelectionSort_~min~0] 628#L12-3 30.39/12.63 [2019-03-28 12:40:53,888 INFO L796 eck$LassoCheckResult]: Loop: 628#L12-3 [99] L12-3-->L14: Formula: (< v_ULTIMATE.start_SelectionSort_~j~0_5 v_ULTIMATE.start_SelectionSort_~array_size_6) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_5, ULTIMATE.start_SelectionSort_~array_size=v_ULTIMATE.start_SelectionSort_~array_size_6} AuxVars[] AssignedVars[] 634#L14 [79] L14-->L14-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~j~0_6))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_SelectionSort_~a.base_3) .cse0)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_3 4) (select |v_#length_3| v_ULTIMATE.start_SelectionSort_~a.base_3)) (<= 0 .cse0)))) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} OutVars{ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_6, ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_3, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_3, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem2] 642#L14-1 [75] L14-1-->L14-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_SelectionSort_~min~0_4))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5))) (and (= |v_ULTIMATE.start_SelectionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_SelectionSort_~a.base_6) .cse0)) (<= (+ .cse1 v_ULTIMATE.start_SelectionSort_~a.offset_5 4) (select |v_#length_5| v_ULTIMATE.start_SelectionSort_~a.base_6)) (<= 0 .cse0) (= (select |v_#valid_7| v_ULTIMATE.start_SelectionSort_~a.base_6) 1)))) InVars {ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} OutVars{ULTIMATE.start_SelectionSort_~a.base=v_ULTIMATE.start_SelectionSort_~a.base_6, ULTIMATE.start_SelectionSort_~a.offset=v_ULTIMATE.start_SelectionSort_~a.offset_5, ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_2|, ULTIMATE.start_SelectionSort_~min~0=v_ULTIMATE.start_SelectionSort_~min~0_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3] 640#L14-2 [115] L14-2-->L12-2: Formula: (>= |v_ULTIMATE.start_SelectionSort_#t~mem2_6| |v_ULTIMATE.start_SelectionSort_#t~mem3_6|) InVars {ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_6|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_6|} OutVars{ULTIMATE.start_SelectionSort_#t~mem3=|v_ULTIMATE.start_SelectionSort_#t~mem3_5|, ULTIMATE.start_SelectionSort_#t~mem2=|v_ULTIMATE.start_SelectionSort_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~mem3, ULTIMATE.start_SelectionSort_#t~mem2] 636#L12-2 [72] L12-2-->L12-3: Formula: (= v_ULTIMATE.start_SelectionSort_~j~0_9 (+ v_ULTIMATE.start_SelectionSort_~j~0_10 1)) InVars {ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_10} OutVars{ULTIMATE.start_SelectionSort_#t~pre1=|v_ULTIMATE.start_SelectionSort_#t~pre1_2|, ULTIMATE.start_SelectionSort_~j~0=v_ULTIMATE.start_SelectionSort_~j~0_9} AuxVars[] AssignedVars[ULTIMATE.start_SelectionSort_#t~pre1, ULTIMATE.start_SelectionSort_~j~0] 628#L12-3 30.39/12.63 [2019-03-28 12:40:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:53,888 INFO L82 PathProgramCache]: Analyzing trace with hash 5375827, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:53,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:53,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:53,899 INFO L82 PathProgramCache]: Analyzing trace with hash 122486931, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:53,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:53,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.63 [2019-03-28 12:40:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash -401294207, now seen corresponding path program 1 times 30.39/12.63 [2019-03-28 12:40:53,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 30.39/12.63 [2019-03-28 12:40:53,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 30.39/12.63 [2019-03-28 12:40:53,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 30.39/12.63 [2019-03-28 12:40:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 30.39/12.63 [2019-03-28 12:40:54,128 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 30.39/12.63 [2019-03-28 12:40:54,186 INFO L216 LassoAnalysis]: Preferences: 30.39/12.63 [2019-03-28 12:40:54,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 30.39/12.63 [2019-03-28 12:40:54,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 30.39/12.63 [2019-03-28 12:40:54,186 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 30.39/12.63 [2019-03-28 12:40:54,186 INFO L127 ssoRankerPreferences]: Use exernal solver: false 30.39/12.63 [2019-03-28 12:40:54,186 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 30.39/12.63 [2019-03-28 12:40:54,186 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 30.39/12.63 [2019-03-28 12:40:54,187 INFO L130 ssoRankerPreferences]: Path of dumped script: 30.39/12.63 [2019-03-28 12:40:54,187 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 30.39/12.63 [2019-03-28 12:40:54,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 30.39/12.63 [2019-03-28 12:40:54,187 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 30.39/12.63 [2019-03-28 12:40:54,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,338 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 30.39/12.63 [2019-03-28 12:40:54,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 30.39/12.63 [2019-03-28 12:40:54,592 INFO L300 LassoAnalysis]: Preprocessing complete. 30.39/12.63 [2019-03-28 12:40:54,592 INFO L497 LassoAnalysis]: Using template 'affine'. 30.39/12.63 [2019-03-28 12:40:54,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:54,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:54,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:54,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:54,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 30.39/12.63 [2019-03-28 12:40:54,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 30.39/12.63 [2019-03-28 12:40:54,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 30.39/12.63 Termination analysis: LINEAR_WITH_GUESSES 30.39/12.63 Number of strict supporting invariants: 0 30.39/12.63 Number of non-strict supporting invariants: 1 30.39/12.63 Consider only non-deceasing supporting invariants: true 30.39/12.63 Simplify termination arguments: true 30.39/12.63 Simplify supporting invariants: trueOverapproximate stem: false 30.39/12.63 [2019-03-28 12:40:54,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. 30.39/12.63 [2019-03-28 12:40:54,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 30.39/12.63 [2019-03-28 12:40:54,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 30.39/12.63 [2019-03-28 12:40:54,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 30.39/12.63 [2019-03-28 12:40:54,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 30.39/12.63 [2019-03-28 12:40:54,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 30.39/12.63 [2019-03-28 12:40:54,639 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 30.39/12.63 [2019-03-28 12:40:54,653 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 30.39/12.63 [2019-03-28 12:40:54,654 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. 30.39/12.64 [2019-03-28 12:40:54,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 30.39/12.64 [2019-03-28 12:40:54,655 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 30.39/12.64 [2019-03-28 12:40:54,655 INFO L518 LassoAnalysis]: Proved termination. 30.39/12.64 [2019-03-28 12:40:54,655 INFO L520 LassoAnalysis]: Termination argument consisting of: 30.39/12.64 Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 - 1*ULTIMATE.start_SelectionSort_~a.offset 30.39/12.64 Supporting invariants [] 30.39/12.64 [2019-03-28 12:40:54,672 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 30.39/12.64 [2019-03-28 12:40:54,673 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 30.39/12.64 [2019-03-28 12:40:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.64 [2019-03-28 12:40:54,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core 30.39/12.64 [2019-03-28 12:40:54,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.64 [2019-03-28 12:40:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.64 [2019-03-28 12:40:54,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.64 [2019-03-28 12:40:54,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.64 [2019-03-28 12:40:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 30.39/12.64 [2019-03-28 12:40:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.64 [2019-03-28 12:40:54,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.64 [2019-03-28 12:40:54,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.64 [2019-03-28 12:40:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 30.39/12.64 [2019-03-28 12:40:54,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 30.39/12.64 [2019-03-28 12:40:54,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... 30.39/12.64 [2019-03-28 12:40:54,820 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 30.39/12.64 [2019-03-28 12:40:54,821 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 30.39/12.64 [2019-03-28 12:40:54,821 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. 30.39/12.64 [2019-03-28 12:40:54,890 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 34 states and 45 transitions. Complement of second has 6 states. 30.39/12.64 [2019-03-28 12:40:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 30.39/12.64 [2019-03-28 12:40:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 30.39/12.64 [2019-03-28 12:40:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. 30.39/12.64 [2019-03-28 12:40:54,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 4 letters. Loop has 5 letters. 30.39/12.64 [2019-03-28 12:40:54,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.64 [2019-03-28 12:40:54,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 9 letters. Loop has 5 letters. 30.39/12.64 [2019-03-28 12:40:54,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.64 [2019-03-28 12:40:54,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 4 letters. Loop has 10 letters. 30.39/12.64 [2019-03-28 12:40:54,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. 30.39/12.64 [2019-03-28 12:40:54,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. 30.39/12.64 [2019-03-28 12:40:54,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.39/12.64 [2019-03-28 12:40:54,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. 30.39/12.64 [2019-03-28 12:40:54,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 30.39/12.64 [2019-03-28 12:40:54,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 30.39/12.64 [2019-03-28 12:40:54,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 30.39/12.64 [2019-03-28 12:40:54,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 30.39/12.64 [2019-03-28 12:40:54,896 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.39/12.64 [2019-03-28 12:40:54,896 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.39/12.64 [2019-03-28 12:40:54,897 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 30.39/12.64 [2019-03-28 12:40:54,897 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 30.39/12.64 [2019-03-28 12:40:54,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 30.39/12.64 [2019-03-28 12:40:54,897 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 30.39/12.64 [2019-03-28 12:40:54,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 30.39/12.64 [2019-03-28 12:40:54,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:54 BasicIcfg 30.39/12.64 [2019-03-28 12:40:54,904 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 30.39/12.64 [2019-03-28 12:40:54,904 INFO L168 Benchmark]: Toolchain (without parser) took 8131.77 ms. Allocated memory was 649.6 MB in the beginning and 844.6 MB in the end (delta: 195.0 MB). Free memory was 564.9 MB in the beginning and 612.3 MB in the end (delta: -47.4 MB). Peak memory consumption was 147.7 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,905 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.33 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 564.9 MB in the beginning and 640.2 MB in the end (delta: -75.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.77 ms. Allocated memory is still 675.8 MB. Free memory was 640.2 MB in the beginning and 638.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,907 INFO L168 Benchmark]: Boogie Preprocessor took 27.40 ms. Allocated memory is still 675.8 MB. Free memory was 638.8 MB in the beginning and 637.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,907 INFO L168 Benchmark]: RCFGBuilder took 322.14 ms. Allocated memory is still 675.8 MB. Free memory was 637.5 MB in the beginning and 614.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,908 INFO L168 Benchmark]: BlockEncodingV2 took 127.25 ms. Allocated memory is still 675.8 MB. Free memory was 614.0 MB in the beginning and 605.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,908 INFO L168 Benchmark]: TraceAbstraction took 3549.70 ms. Allocated memory was 675.8 MB in the beginning and 744.5 MB in the end (delta: 68.7 MB). Free memory was 604.5 MB in the beginning and 519.2 MB in the end (delta: 85.3 MB). Peak memory consumption was 154.0 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,909 INFO L168 Benchmark]: BuchiAutomizer took 3736.69 ms. Allocated memory was 744.5 MB in the beginning and 844.6 MB in the end (delta: 100.1 MB). Free memory was 519.2 MB in the beginning and 612.3 MB in the end (delta: -93.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 50.3 GB. 30.39/12.64 [2019-03-28 12:40:54,913 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 30.39/12.64 --- Results --- 30.39/12.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 30.39/12.64 - StatisticsResult: Initial Icfg 30.39/12.64 33 locations, 38 edges 30.39/12.64 - StatisticsResult: Encoded RCFG 30.39/12.64 25 locations, 41 edges 30.39/12.64 * Results from de.uni_freiburg.informatik.ultimate.core: 30.39/12.64 - StatisticsResult: Toolchain Benchmarks 30.39/12.64 Benchmark results are: 30.39/12.64 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 30.39/12.64 * CACSL2BoogieTranslator took 321.33 ms. Allocated memory was 649.6 MB in the beginning and 675.8 MB in the end (delta: 26.2 MB). Free memory was 564.9 MB in the beginning and 640.2 MB in the end (delta: -75.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 30.39/12.64 * Boogie Procedure Inliner took 41.77 ms. Allocated memory is still 675.8 MB. Free memory was 640.2 MB in the beginning and 638.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.39/12.64 * Boogie Preprocessor took 27.40 ms. Allocated memory is still 675.8 MB. Free memory was 638.8 MB in the beginning and 637.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 30.39/12.64 * RCFGBuilder took 322.14 ms. Allocated memory is still 675.8 MB. Free memory was 637.5 MB in the beginning and 614.0 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. 30.39/12.64 * BlockEncodingV2 took 127.25 ms. Allocated memory is still 675.8 MB. Free memory was 614.0 MB in the beginning and 605.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 30.39/12.64 * TraceAbstraction took 3549.70 ms. Allocated memory was 675.8 MB in the beginning and 744.5 MB in the end (delta: 68.7 MB). Free memory was 604.5 MB in the beginning and 519.2 MB in the end (delta: 85.3 MB). Peak memory consumption was 154.0 MB. Max. memory is 50.3 GB. 30.39/12.64 * BuchiAutomizer took 3736.69 ms. Allocated memory was 744.5 MB in the beginning and 844.6 MB in the end (delta: 100.1 MB). Free memory was 519.2 MB in the beginning and 612.3 MB in the end (delta: -93.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 50.3 GB. 30.39/12.64 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 - GenericResult: Unfinished Backtranslation 30.39/12.64 unknown boogie variable #length 30.39/12.64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 30.39/12.64 - PositiveResult [Line: 19]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 20]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 14]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 20]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 14]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 18]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 14]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 18]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 19]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 14]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 19]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - PositiveResult [Line: 19]: pointer dereference always succeeds 30.39/12.64 For all program executions holds that pointer dereference always succeeds at this location 30.39/12.64 - AllSpecificationsHoldResult: All specifications hold 30.39/12.64 12 specifications checked. All of them hold 30.39/12.64 - InvariantResult [Line: 8]: Loop Invariant 30.39/12.64 [2019-03-28 12:40:54,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 Derived loop invariant: ((((4 * i + a + 4 <= unknown-#length-unknown[a] && a + 4 * min + 4 <= unknown-#length-unknown[a]) && (\exists ULTIMATE.start_main_~array_size~0 : int :: unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0 && array_size <= ULTIMATE.start_main_~array_size~0)) && (((((min + 1 <= j && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a]) && 0 <= a + 4 * min) && a == 0) && 1 <= array_size) && \valid[a] == 1) || (((array_size <= i + 1 && a + 4 * min + 4 <= unknown-#length-unknown[a]) && j <= i + 1) && (((((min + 1 <= j && 0 <= i) && 4 * array_size <= unknown-#length-unknown[a]) && 0 <= a + 4 * min) && a == 0) && 1 <= array_size) && \valid[a] == 1)) || (((((0 == i && 4 <= unknown-#length-unknown[a]) && a == 0) && 1 <= array_size) && (\exists ULTIMATE.start_main_~array_size~0 : int :: unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0 && array_size <= ULTIMATE.start_main_~array_size~0)) && \valid[a] == 1) 30.39/12.64 - InvariantResult [Line: 12]: Loop Invariant 30.39/12.64 [2019-03-28 12:40:54,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,933 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,933 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,934 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,934 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] 30.39/12.64 [2019-03-28 12:40:54,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 [2019-03-28 12:40:54,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 30.39/12.64 Derived loop invariant: (((\exists ULTIMATE.start_main_~array_size~0 : int :: i + 2 <= ULTIMATE.start_main_~array_size~0 && unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0) && (((((((min + 1 <= j && 0 <= i) && 0 <= a + 4 * min) && a == 0) && 1 <= array_size) && a + 4 * min + 8 <= unknown-#length-unknown[a]) && \valid[a] == 1) || ((((((min + 1 <= j && a + 4 * min + 4 <= unknown-#length-unknown[a]) && 0 <= i) && 1 <= min) && a == 0) && 1 <= array_size) && \valid[a] == 1))) && i + 1 <= j) && (\exists ULTIMATE.start_main_~array_size~0 : int :: unknown-#length-unknown[a] == 4 * ULTIMATE.start_main_~array_size~0 && array_size <= ULTIMATE.start_main_~array_size~0) 30.39/12.64 - StatisticsResult: Ultimate Automizer benchmark data 30.39/12.64 CFG has 1 procedures, 25 locations, 12 error locations. SAFE Result, 3.4s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 415 SDslu, 178 SDs, 0 SdLazy, 650 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 87 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 12 NumberOfFragments, 258 HoareAnnotationTreeSize, 2 FomulaSimplifications, 2031 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 744 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 201 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 186 ConstructedInterpolants, 24 QuantifiedInterpolants, 22904 SizeOfPredicates, 21 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 47/88 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 30.39/12.64 - StatisticsResult: Constructed decomposition of program 30.39/12.64 Your program was decomposed into 4 terminating modules (1 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a + -4 * i and consists of 4 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -4 * j + unknown-#length-unknown[a] + -1 * a and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 30.39/12.64 - StatisticsResult: Timing statistics 30.39/12.64 BüchiAutomizer plugin needed 3.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 50 SDtfs, 125 SDslu, 39 SDs, 0 SdLazy, 179 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax100 hnf100 lsp96 ukn74 mio100 lsp67 div100 bol100 ite100 ukn100 eq176 hnf89 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 113ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 30.39/12.64 - TerminationAnalysisResult: Termination proven 30.39/12.64 Buchi Automizer proved that your program is terminating 30.39/12.64 RESULT: Ultimate proved your program to be correct! 30.39/12.64 !SESSION 2019-03-28 12:40:43.521 ----------------------------------------------- 30.39/12.64 eclipse.buildId=unknown 30.39/12.64 java.version=1.8.0_181 30.39/12.64 java.vendor=Oracle Corporation 30.39/12.64 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 30.39/12.64 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 30.39/12.64 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 30.39/12.64 30.39/12.64 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:40:55.163 30.39/12.64 !MESSAGE The workspace will exit with unsaved changes in this session. 30.39/12.64 Received shutdown request... 30.39/12.64 Ultimate: 30.39/12.64 GTK+ Version Check 30.39/12.64 EOF