./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f42aa215a16d5e0efb670a585ba0238849a32fc4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:25:19,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:25:19,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:25:19,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:25:19,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:25:19,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:25:19,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:25:19,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:25:19,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:25:19,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:25:19,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:25:19,149 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:25:19,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:25:19,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:25:19,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:25:19,152 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:25:19,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:25:19,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:25:19,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:25:19,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:25:19,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:25:19,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:25:19,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:25:19,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:25:19,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:25:19,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:25:19,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:25:19,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:25:19,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:25:19,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:25:19,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:25:19,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:25:19,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:25:19,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:25:19,167 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:25:19,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:25:19,168 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:25:19,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:25:19,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:25:19,181 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:25:19,181 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:25:19,181 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:25:19,181 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:25:19,181 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:25:19,182 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:25:19,182 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:25:19,182 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:25:19,182 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:25:19,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:25:19,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:25:19,182 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:25:19,183 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:25:19,184 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:25:19,184 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:25:19,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:25:19,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:25:19,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:25:19,184 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:25:19,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:25:19,184 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:25:19,185 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:25:19,185 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:25:19,185 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f42aa215a16d5e0efb670a585ba0238849a32fc4 [2018-11-22 22:25:19,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:25:19,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:25:19,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:25:19,223 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:25:19,223 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:25:19,224 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:25:19,266 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/data/398927f8d/e97bd3843248410c9e633160961fd930/FLAGce441ff5f [2018-11-22 22:25:19,631 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:25:19,631 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:25:19,640 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/data/398927f8d/e97bd3843248410c9e633160961fd930/FLAGce441ff5f [2018-11-22 22:25:20,028 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/data/398927f8d/e97bd3843248410c9e633160961fd930 [2018-11-22 22:25:20,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:25:20,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:25:20,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:25:20,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:25:20,034 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:25:20,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8dd392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20, skipping insertion in model container [2018-11-22 22:25:20,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:25:20,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:25:20,251 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:25:20,260 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:25:20,288 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:25:20,356 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:25:20,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20 WrapperNode [2018-11-22 22:25:20,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:25:20,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:25:20,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:25:20,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:25:20,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:25:20,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:25:20,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:25:20,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:25:20,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... [2018-11-22 22:25:20,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:25:20,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:25:20,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:25:20,408 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:25:20,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6cd7acde-d855-416b-835e-0aea4df059e0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:25:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:25:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:25:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:25:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:25:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:25:20,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:25:20,572 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:25:20,573 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-22 22:25:20,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:25:20 BoogieIcfgContainer [2018-11-22 22:25:20,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:25:20,573 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:25:20,573 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:25:20,576 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:25:20,576 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:25:20,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:25:20" (1/3) ... [2018-11-22 22:25:20,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49a6e102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:25:20, skipping insertion in model container [2018-11-22 22:25:20,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:25:20,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:25:20" (2/3) ... [2018-11-22 22:25:20,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49a6e102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:25:20, skipping insertion in model container [2018-11-22 22:25:20,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:25:20,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:25:20" (3/3) ... [2018-11-22 22:25:20,580 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-11-22 22:25:20,617 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:25:20,617 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:25:20,617 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:25:20,617 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:25:20,617 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:25:20,617 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:25:20,617 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:25:20,617 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:25:20,617 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:25:20,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 22:25:20,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 22:25:20,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:25:20,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:25:20,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:25:20,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:25:20,644 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:25:20,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-22 22:25:20,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 22:25:20,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:25:20,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:25:20,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:25:20,646 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:25:20,654 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L558-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 11#L545-3true [2018-11-22 22:25:20,654 INFO L796 eck$LassoCheckResult]: Loop: 11#L545-3true assume !!(test_fun_~i~0 < test_fun_~N); 8#L546-3true assume !true; 3#L550-2true assume !true; 9#L545-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L545-3true [2018-11-22 22:25:20,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-22 22:25:20,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:20,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:20,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2018-11-22 22:25:20,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:20,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:20,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:20,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:20,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:25:20,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:25:20,767 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:25:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:25:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:25:20,779 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-22 22:25:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:25:20,783 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-22 22:25:20,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:25:20,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-22 22:25:20,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 22:25:20,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-22 22:25:20,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 22:25:20,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 22:25:20,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-22 22:25:20,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:25:20,790 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:25:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-22 22:25:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-22 22:25:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 22:25:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-22 22:25:20,807 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:25:20,808 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:25:20,808 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:25:20,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-22 22:25:20,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 22:25:20,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:25:20,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:25:20,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 22:25:20,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-22 22:25:20,809 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 41#L545-3 [2018-11-22 22:25:20,809 INFO L796 eck$LassoCheckResult]: Loop: 41#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 42#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 38#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 41#L545-3 [2018-11-22 22:25:20,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:20,809 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-22 22:25:20,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:20,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:20,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:20,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:20,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2018-11-22 22:25:20,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:20,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:20,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2018-11-22 22:25:20,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:21,042 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:25:21,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:25:21,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:25:21,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:25:21,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:25:21,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:25:21,044 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:25:21,044 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:25:21,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-22 22:25:21,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:25:21,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:25:21,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:25:21,459 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:25:21,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:21,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:21,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:21,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:21,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:21,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:21,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:21,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:21,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:21,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:21,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:21,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:21,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:21,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:21,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:21,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:21,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:21,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:21,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:21,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:21,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:21,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:25:21,608 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:25:21,609 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 22:25:21,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:25:21,612 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:25:21,612 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:25:21,613 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-22 22:25:21,625 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:25:21,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:21,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:21,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:21,674 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:25:21,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-22 22:25:21,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 23 transitions. Complement of second has 4 states. [2018-11-22 22:25:21,703 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 [2018-11-22 22:25:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-22 22:25:21,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-22 22:25:21,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:21,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-22 22:25:21,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:21,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-22 22:25:21,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:21,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-11-22 22:25:21,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:25:21,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2018-11-22 22:25:21,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 22:25:21,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 22:25:21,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-22 22:25:21,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:25:21,708 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 22:25:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-22 22:25:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-22 22:25:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-22 22:25:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-22 22:25:21,710 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-22 22:25:21,710 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-22 22:25:21,710 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:25:21,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-22 22:25:21,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:25:21,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:25:21,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:25:21,711 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:25:21,711 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:25:21,712 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 126#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 132#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 133#L546-3 [2018-11-22 22:25:21,712 INFO L796 eck$LassoCheckResult]: Loop: 133#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 137#L546-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 133#L546-3 [2018-11-22 22:25:21,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:21,712 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-22 22:25:21,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:21,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:21,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:21,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-22 22:25:21,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:21,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:21,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:21,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-22 22:25:21,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:21,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:21,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:21,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:21,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:21,882 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:25:21,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:25:21,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:25:21,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:25:21,882 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:25:21,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:25:21,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:25:21,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:25:21,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-22 22:25:21,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:25:21,883 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:25:21,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:21,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:25:22,147 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:25:22,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:22,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:22,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:22,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:22,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,185 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:25:22,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,186 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:25:22,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,194 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:25:22,195 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:25:22,195 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:25:22,195 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:25:22,196 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:25:22,196 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:25:22,196 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-22 22:25:22,232 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 22:25:22,234 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:25:22,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:22,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:22,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:22,277 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:25:22,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-22 22:25:22,298 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2018-11-22 22:25:22,299 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 [2018-11-22 22:25:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-22 22:25:22,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-22 22:25:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:22,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-22 22:25:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:22,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 22:25:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:22,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-22 22:25:22,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:25:22,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2018-11-22 22:25:22,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-22 22:25:22,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-22 22:25:22,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-11-22 22:25:22,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:25:22,302 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-11-22 22:25:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-11-22 22:25:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-11-22 22:25:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-22 22:25:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-22 22:25:22,304 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-22 22:25:22,304 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-22 22:25:22,304 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:25:22,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-22 22:25:22,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:25:22,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:25:22,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:25:22,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:22,305 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:25:22,305 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 234#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 241#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 235#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 236#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 243#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 229#L550-2 [2018-11-22 22:25:22,305 INFO L796 eck$LassoCheckResult]: Loop: 229#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 230#L550 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 229#L550-2 [2018-11-22 22:25:22,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-22 22:25:22,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:22,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:22,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:22,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2018-11-22 22:25:22,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:22,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2018-11-22 22:25:22,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:22,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:22,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:22,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,485 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:25:22,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:25:22,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:25:22,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:25:22,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:25:22,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:25:22,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:25:22,485 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:25:22,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-22 22:25:22,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:25:22,486 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:25:22,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:22,752 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:25:22,752 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:25:22,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:22,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:22,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:22,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:22,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:22,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:22,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:22,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:22,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:22,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:22,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:22,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:22,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:22,773 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:25:22,776 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:25:22,777 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:25:22,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:25:22,778 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:25:22,778 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:25:22,778 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-22 22:25:22,801 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 22:25:22,802 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:25:22,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:22,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:22,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:22,837 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:25:22,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-22 22:25:22,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2018-11-22 22:25:22,852 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 [2018-11-22 22:25:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-22 22:25:22,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-22 22:25:22,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:22,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-22 22:25:22,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:22,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:25:22,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:22,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-11-22 22:25:22,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:25:22,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2018-11-22 22:25:22,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 22:25:22,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 22:25:22,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-11-22 22:25:22,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:25:22,854 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-22 22:25:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-11-22 22:25:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-22 22:25:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 22:25:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-22 22:25:22,855 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-22 22:25:22,855 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-22 22:25:22,855 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:25:22,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-22 22:25:22,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-22 22:25:22,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:25:22,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:25:22,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:22,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:25:22,856 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 354#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 360#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 355#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 356#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 369#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 365#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 368#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 366#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 357#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 359#L546-3 [2018-11-22 22:25:22,856 INFO L796 eck$LassoCheckResult]: Loop: 359#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 362#L546-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 359#L546-3 [2018-11-22 22:25:22,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2018-11-22 22:25:22,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:22,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:22,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:22,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-22 22:25:22,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:22,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:22,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2018-11-22 22:25:22,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:22,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:22,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:22,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:23,031 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:25:23,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:25:23,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:25:23,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:25:23,031 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:25:23,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:25:23,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:25:23,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:25:23,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-22 22:25:23,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:25:23,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:25:23,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,265 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:25:23,265 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:25:23,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:23,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:23,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:23,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:23,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:23,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:23,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:23,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:23,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:23,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:23,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:23,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:23,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:23,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:23,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:23,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:23,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:23,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:23,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:23,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:23,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:23,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:23,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:23,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:23,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:23,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:23,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:23,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:23,301 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:25:23,301 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:25:23,302 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:25:23,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:25:23,302 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:25:23,302 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:25:23,302 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2018-11-22 22:25:23,335 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 22:25:23,336 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:25:23,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:23,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:23,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:23,371 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:25:23,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-22 22:25:23,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-22 22:25:23,389 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 [2018-11-22 22:25:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-22 22:25:23,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-22 22:25:23,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:23,390 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:25:23,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:23,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:23,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:23,422 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:25:23,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-22 22:25:23,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-22 22:25:23,438 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 [2018-11-22 22:25:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-22 22:25:23,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-22 22:25:23,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:23,439 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:25:23,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:23,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:23,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:23,488 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 2 loop predicates [2018-11-22 22:25:23,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-22 22:25:23,513 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2018-11-22 22:25:23,513 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 [2018-11-22 22:25:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-22 22:25:23,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-22 22:25:23,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:23,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-22 22:25:23,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:23,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-22 22:25:23,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:23,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2018-11-22 22:25:23,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:25:23,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2018-11-22 22:25:23,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 22:25:23,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 22:25:23,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-11-22 22:25:23,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:25:23,518 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-22 22:25:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-11-22 22:25:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-22 22:25:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 22:25:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-22 22:25:23,522 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-22 22:25:23,522 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-22 22:25:23,522 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:25:23,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-22 22:25:23,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:25:23,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:25:23,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:25:23,524 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:25:23,524 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:25:23,524 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 653#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 654#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 655#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 656#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 664#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 668#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 657#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 659#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 648#L550-2 [2018-11-22 22:25:23,524 INFO L796 eck$LassoCheckResult]: Loop: 648#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 649#L550 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 648#L550-2 [2018-11-22 22:25:23,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:23,524 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2018-11-22 22:25:23,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:23,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:23,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:25:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:23,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:23,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2018-11-22 22:25:23,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:23,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:23,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:23,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:23,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2018-11-22 22:25:23,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:25:23,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:25:23,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:23,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:25:23,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:25:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:25:23,766 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-11-22 22:25:23,802 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:25:23,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:25:23,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:25:23,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:25:23,803 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:25:23,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:25:23,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:25:23,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:25:23,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-22 22:25:23,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:25:23,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:25:23,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:23,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:25:24,191 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:25:24,191 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:25:24,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:24,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:24,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:24,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:24,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:24,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:24,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:24,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:24,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:24,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:24,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:24,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:24,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:24,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:24,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:24,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:24,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:24,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:24,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:24,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:25:24,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:24,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:24,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:24,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:25:24,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:25:24,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:24,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:24,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:24,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:24,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:24,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:24,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:24,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:24,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:25:24,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:25:24,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:25:24,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:25:24,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:25:24,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:25:24,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:25:24,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:25:24,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:25:24,223 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:25:24,223 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:25:24,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:25:24,224 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:25:24,224 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:25:24,224 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_4 Supporting invariants [] [2018-11-22 22:25:24,236 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-22 22:25:24,237 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:25:24,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:24,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:24,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:24,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:25:24,269 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-22 22:25:24,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-22 22:25:24,283 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 [2018-11-22 22:25:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-22 22:25:24,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-22 22:25:24,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:24,284 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:25:24,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:24,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:24,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:24,313 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 22:25:24,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-22 22:25:24,322 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-22 22:25:24,322 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 [2018-11-22 22:25:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-22 22:25:24,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-22 22:25:24,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:24,323 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:25:24,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:25:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:24,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:25:24,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:25:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:25:24,350 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 2 loop predicates [2018-11-22 22:25:24,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-22 22:25:24,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2018-11-22 22:25:24,361 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 [2018-11-22 22:25:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:25:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-22 22:25:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-22 22:25:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-22 22:25:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-22 22:25:24,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:25:24,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-22 22:25:24,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:25:24,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-22 22:25:24,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:25:24,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:25:24,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:25:24,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:25:24,362 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:25:24,363 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:25:24,363 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:25:24,363 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:25:24,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:25:24,363 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:25:24,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:25:24,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:25:24 BoogieIcfgContainer [2018-11-22 22:25:24,367 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:25:24,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:25:24,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:25:24,367 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:25:24,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:25:20" (3/4) ... [2018-11-22 22:25:24,370 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:25:24,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:25:24,370 INFO L168 Benchmark]: Toolchain (without parser) took 4339.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.3 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -215.2 MB). Peak memory consumption was 148.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:24,371 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:25:24,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -202.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:24,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:24,372 INFO L168 Benchmark]: Boogie Preprocessor took 19.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:24,373 INFO L168 Benchmark]: RCFGBuilder took 164.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:24,373 INFO L168 Benchmark]: BuchiAutomizer took 3793.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.4 MB). Peak memory consumption was 158.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:25:24,374 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:25:24,377 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -202.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 164.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3793.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -36.4 MB). Peak memory consumption was 158.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.66 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 85 SDslu, 9 SDs, 0 SdLazy, 108 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital151 mio100 ax100 hnf99 lsp89 ukn78 mio100 lsp54 div100 bol100 ite100 ukn100 eq176 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...