./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/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 64bit --witnessprinter.graph.data.programhash 25885afdfdd91cf9312b78ad87a032f4ef31fe0c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:10:53,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:10:53,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:10:53,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:10:53,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:10:53,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:10:53,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:10:53,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:10:53,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:10:53,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:10:53,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:10:53,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:10:53,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:10:53,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:10:53,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:10:53,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:10:53,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:10:53,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:10:53,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:10:53,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:10:53,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:10:53,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:10:53,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:10:53,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:10:53,309 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:10:53,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:10:53,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:10:53,311 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:10:53,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:10:53,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:10:53,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:10:53,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:10:53,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:10:53,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:10:53,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:10:53,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:10:53,315 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 03:10:53,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:10:53,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:10:53,327 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:10:53,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:10:53,328 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:10:53,328 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:10:53,328 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:10:53,328 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:10:53,328 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:10:53,328 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:10:53,328 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:10:53,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:10:53,329 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:10:53,330 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:10:53,330 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:10:53,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:10:53,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:10:53,330 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:10:53,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:10:53,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:10:53,331 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:10:53,331 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:10:53,331 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_46601e17-f5fc-4c3d-bd6d-b75506317b74/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25885afdfdd91cf9312b78ad87a032f4ef31fe0c [2018-11-23 03:10:53,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:10:53,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:10:53,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:10:53,365 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:10:53,366 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:10:53,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-23 03:10:53,404 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/data/7ce3fc29f/5a05a447e31b49cab694d6e483a02ff3/FLAG03afe1452 [2018-11-23 03:10:53,769 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:10:53,770 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/sv-benchmarks/c/termination-memory-alloca/b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-23 03:10:53,779 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/data/7ce3fc29f/5a05a447e31b49cab694d6e483a02ff3/FLAG03afe1452 [2018-11-23 03:10:53,791 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/data/7ce3fc29f/5a05a447e31b49cab694d6e483a02ff3 [2018-11-23 03:10:53,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:10:53,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:10:53,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:10:53,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:10:53,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:10:53,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:10:53" (1/1) ... [2018-11-23 03:10:53,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4071ea38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:53, skipping insertion in model container [2018-11-23 03:10:53,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:10:53" (1/1) ... [2018-11-23 03:10:53,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:10:53,838 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:10:54,040 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:10:54,048 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:10:54,119 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:10:54,142 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:10:54,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54 WrapperNode [2018-11-23 03:10:54,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:10:54,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:10:54,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:10:54,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:10:54,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:10:54,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:10:54,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:10:54,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:10:54,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... [2018-11-23 03:10:54,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:10:54,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:10:54,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:10:54,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:10:54,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/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-23 03:10:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:10:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:10:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:10:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:10:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:10:54,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:10:54,386 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:10:54,387 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 03:10:54,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:10:54 BoogieIcfgContainer [2018-11-23 03:10:54,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:10:54,388 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:10:54,388 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:10:54,390 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:10:54,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:10:54,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:10:53" (1/3) ... [2018-11-23 03:10:54,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dc7ada7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:10:54, skipping insertion in model container [2018-11-23 03:10:54,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:10:54,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:10:54" (2/3) ... [2018-11-23 03:10:54,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dc7ada7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:10:54, skipping insertion in model container [2018-11-23 03:10:54,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:10:54,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:10:54" (3/3) ... [2018-11-23 03:10:54,394 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-23 03:10:54,438 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:10:54,439 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:10:54,439 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:10:54,439 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:10:54,439 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:10:54,439 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:10:54,439 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:10:54,440 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:10:54,440 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:10:54,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 03:10:54,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:10:54,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:10:54,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:10:54,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:10:54,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:10:54,475 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:10:54,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 03:10:54,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:10:54,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:10:54,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:10:54,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 03:10:54,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:10:54,481 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 6#L555true assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 10#L555-2true assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 7#L558-3true [2018-11-23 03:10:54,482 INFO L796 eck$LassoCheckResult]: Loop: 7#L558-3true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L558-1true assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 16#L559true assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 5#L559-2true call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 7#L558-3true [2018-11-23 03:10:54,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-11-23 03:10:54,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:54,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:54,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:10:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:54,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1482703, now seen corresponding path program 1 times [2018-11-23 03:10:54,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:54,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:54,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:54,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:10:54,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:54,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:54,623 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 1 times [2018-11-23 03:10:54,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:54,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:54,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:54,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:10:54,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:55,148 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2018-11-23 03:10:55,254 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:10:55,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:10:55,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:10:55,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:10:55,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:10:55,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:10:55,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:10:55,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:10:55,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-23 03:10:55,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:10:55,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:10:55,276 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-23 03:10:55,281 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-23 03:10:55,283 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-23 03:10:55,284 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-23 03:10:55,286 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-23 03:10:55,289 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-23 03:10:55,292 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-23 03:10:55,293 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-23 03:10:55,295 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-23 03:10:55,298 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-23 03:10:55,300 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-23 03:10:55,302 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-23 03:10:55,307 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-23 03:10:55,309 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-23 03:10:55,311 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-23 03:10:55,313 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-23 03:10:55,540 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2018-11-23 03:10:55,621 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-23 03:10:55,623 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-23 03:10:55,624 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-23 03:10:55,625 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-23 03:10:55,626 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-23 03:10:55,628 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-23 03:10:56,003 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:10:56,008 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:10:56,010 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-23 03:10:56,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,015 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-23 03:10:56,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,019 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-23 03:10:56,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,022 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-23 03:10:56,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,024 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-23 03:10:56,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,027 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-23 03:10:56,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:56,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,032 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-23 03:10:56,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,036 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-23 03:10:56,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:56,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,045 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-23 03:10:56,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:56,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,052 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-23 03:10:56,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,056 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-23 03:10:56,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,060 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-23 03:10:56,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:56,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,067 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-23 03:10:56,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,071 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-23 03:10:56,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,073 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-23 03:10:56,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:56,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:56,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:56,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,076 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-23 03:10:56,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,076 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:10:56,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,077 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:10:56,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,086 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-23 03:10:56,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:56,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,100 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-23 03:10:56,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,102 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:10:56,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,103 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:10:56,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,112 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-23 03:10:56,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:56,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:56,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:56,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:56,118 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-23 03:10:56,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:56,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:56,118 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:10:56,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:56,126 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 03:10:56,126 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 03:10:56,188 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:10:56,223 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 03:10:56,223 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-23 03:10:56,225 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:10:56,227 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 03:10:56,227 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:10:56,228 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-23 03:10:56,308 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 03:10:56,314 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:10:56,315 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:10:56,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:10:56,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:10:56,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 03:10:56,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:56,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-11-23 03:10:56,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2018-11-23 03:10:56,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 03:10:56,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-11-23 03:10:56,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 03:10:56,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-23 03:10:56,512 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 03:10:56,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 03:10:56,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 03:10:56,542 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,546 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 03:10:56,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 03:10:56,553 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-23 03:10:56,560 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:10:56,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-23 03:10:56,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-23 03:10:56,590 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-11-23 03:10:56,602 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 03:10:56,617 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 03:10:56,627 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:10:56,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:10:56,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:10:56,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:10:56,680 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:91, output treesize:10 [2018-11-23 03:10:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:10:56,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:10:56,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:56,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-11-23 03:10:56,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 03:10:56,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:56,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:56,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-11-23 03:10:56,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:56,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:10:56,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:10:56,789 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:50 [2018-11-23 03:10:56,809 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-23 03:10:56,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-23 03:10:56,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2018-11-23 03:10:56,888 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 37 states and 45 transitions. Complement of second has 8 states. [2018-11-23 03:10:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:10:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:10:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 03:10:56,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-23 03:10:56,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:10:56,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 03:10:56,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:10:56,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-23 03:10:56,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:10:56,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2018-11-23 03:10:56,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:10:56,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 18 states and 22 transitions. [2018-11-23 03:10:56,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:10:56,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 03:10:56,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-11-23 03:10:56,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:10:56,901 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-23 03:10:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-11-23 03:10:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-23 03:10:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 03:10:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-23 03:10:56,921 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 03:10:56,921 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-23 03:10:56,921 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:10:56,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-23 03:10:56,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:10:56,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:10:56,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:10:56,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:10:56,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:10:56,923 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 208#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 209#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 210#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-11-23 03:10:56,923 INFO L796 eck$LassoCheckResult]: Loop: 216#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 217#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 220#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 212#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 213#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 216#L558-1 [2018-11-23 03:10:56,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 28695881, now seen corresponding path program 1 times [2018-11-23 03:10:56,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:56,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:56,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:10:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:56,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 50737098, now seen corresponding path program 1 times [2018-11-23 03:10:56,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:56,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:10:56,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:56,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1682923394, now seen corresponding path program 1 times [2018-11-23 03:10:56,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:56,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:10:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:57,263 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2018-11-23 03:10:57,330 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:10:57,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:10:57,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:10:57,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:10:57,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:10:57,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:10:57,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:10:57,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:10:57,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-23 03:10:57,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:10:57,331 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:10:57,334 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-23 03:10:57,336 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-23 03:10:57,337 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-23 03:10:57,338 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-23 03:10:57,340 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-23 03:10:57,341 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-23 03:10:57,569 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-23 03:10:57,573 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-23 03:10:57,574 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-23 03:10:57,576 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-23 03:10:57,577 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-23 03:10:57,578 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-23 03:10:57,580 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-23 03:10:57,581 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-23 03:10:57,583 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-23 03:10:57,584 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-23 03:10:57,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-23 03:10:57,586 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-23 03:10:57,588 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-23 03:10:57,589 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-23 03:10:57,593 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-23 03:10:57,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:10:57,935 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:10:57,937 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-23 03:10:57,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:57,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:57,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:57,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,939 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-23 03:10:57,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:57,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:57,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:57,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,941 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-23 03:10:57,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:57,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,943 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-23 03:10:57,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:57,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,946 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-23 03:10:57,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:57,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:57,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:57,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,948 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-23 03:10:57,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,948 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:10:57,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,950 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:10:57,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,953 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-23 03:10:57,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,953 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:10:57,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,954 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:10:57,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,958 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-23 03:10:57,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:57,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,963 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-23 03:10:57,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,963 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:10:57,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,964 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:10:57,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,971 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-23 03:10:57,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:57,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,973 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-23 03:10:57,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:57,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,978 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-23 03:10:57,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:57,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:57,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:57,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:57,982 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-23 03:10:57,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:57,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:57,983 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:10:57,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:57,988 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 03:10:57,988 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 03:10:58,016 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:10:58,034 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 03:10:58,034 INFO L444 ModelExtractionUtils]: 43 out of 51 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 03:10:58,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:10:58,036 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 03:10:58,036 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:10:58,036 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-23 03:10:58,108 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 03:10:58,110 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:10:58,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:10:58,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:10:58,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-11-23 03:10:58,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 03:10:58,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-11-23 03:10:58,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-23 03:10:58,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 03:10:58,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 03:10:58,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 03:10:58,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 03:10:58,254 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 03:10:58,259 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,262 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-23 03:10:58,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-23 03:10:58,291 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 03:10:58,303 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-23 03:10:58,313 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:10:58,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 03:10:58,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 03:10:58,334 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,337 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:10:58,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:10:58,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:10:58,380 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:71, output treesize:10 [2018-11-23 03:10:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:10:58,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:10:58,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:58,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-23 03:10:58,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:58,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 03:10:58,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 03:10:58,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:58,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-11-23 03:10:58,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:10:58,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 03:10:58,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:10:58,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2018-11-23 03:10:58,451 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-23 03:10:58,451 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-23 03:10:58,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-23 03:10:58,485 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2018-11-23 03:10:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:10:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 03:10:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-23 03:10:58,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-23 03:10:58,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:10:58,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-23 03:10:58,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:10:58,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-23 03:10:58,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:10:58,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-23 03:10:58,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:10:58,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 25 states and 30 transitions. [2018-11-23 03:10:58,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:10:58,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:10:58,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-23 03:10:58,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:10:58,489 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 03:10:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-23 03:10:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 03:10:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 03:10:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-23 03:10:58,491 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 03:10:58,491 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 03:10:58,491 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:10:58,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-11-23 03:10:58,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:10:58,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:10:58,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:10:58,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:10:58,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:10:58,492 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 420#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 421#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 422#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 434#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 438#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 437#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-11-23 03:10:58,493 INFO L796 eck$LassoCheckResult]: Loop: 425#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 428#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 429#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 432#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 424#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 425#L558-3 [2018-11-23 03:10:58,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash 180521911, now seen corresponding path program 2 times [2018-11-23 03:10:58,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:58,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:58,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:10:58,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:58,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 2 times [2018-11-23 03:10:58,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:58,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:58,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:58,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:10:58,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:58,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:10:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash -915687550, now seen corresponding path program 1 times [2018-11-23 03:10:58,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:10:58,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:10:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:58,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:10:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:10:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:10:58,653 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-23 03:10:59,211 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2018-11-23 03:10:59,389 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-11-23 03:10:59,391 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:10:59,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:10:59,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:10:59,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:10:59,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:10:59,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:10:59,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:10:59,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:10:59,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-23 03:10:59,392 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:10:59,392 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:10:59,394 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-23 03:10:59,395 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-23 03:10:59,396 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-23 03:10:59,399 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-23 03:10:59,401 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-23 03:10:59,402 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-23 03:10:59,403 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-23 03:10:59,404 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-23 03:10:59,405 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-23 03:10:59,407 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-23 03:10:59,408 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-23 03:10:59,409 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-23 03:10:59,410 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-23 03:10:59,411 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-23 03:10:59,601 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-23 03:10:59,674 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-23 03:10:59,675 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-23 03:10:59,676 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-23 03:10:59,678 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-23 03:10:59,679 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-23 03:10:59,680 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-23 03:10:59,681 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-23 03:10:59,684 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-23 03:10:59,970 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:10:59,971 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:10:59,971 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-23 03:10:59,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,974 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-23 03:10:59,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,975 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-23 03:10:59,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:59,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:59,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,982 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-23 03:10:59,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:59,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:59,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,985 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-23 03:10:59,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,987 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-23 03:10:59,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,988 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-23 03:10:59,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:10:59,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:10:59,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,991 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-23 03:10:59,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,993 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-23 03:10:59,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,994 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-23 03:10:59,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,996 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-23 03:10:59,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,998 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-23 03:10:59,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:10:59,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:10:59,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:10:59,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:10:59,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:10:59,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:10:59,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:10:59,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:10:59,999 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-23 03:11:00,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:00,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:00,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:00,002 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-23 03:11:00,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:00,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:00,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:00,006 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-23 03:11:00,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:00,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:00,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:00,010 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-23 03:11:00,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:00,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:00,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:00,015 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-23 03:11:00,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,015 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:11:00,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,016 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:11:00,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:00,019 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-23 03:11:00,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:00,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:00,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:00,021 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-23 03:11:00,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:00,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:00,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:11:00,026 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-23 03:11:00,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:11:00,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:11:00,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:11:00,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:11:00,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:11:00,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:11:00,037 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:11:00,044 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:11:00,044 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 03:11:00,045 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:11:00,045 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:11:00,046 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:11:00,046 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-23 03:11:00,108 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 03:11:00,110 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 03:11:00,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:00,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:00,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 03:11:00,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-23 03:11:00,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 03:11:00,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 03:11:00,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 03:11:00,175 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-23 03:11:00,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 03:11:00,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 29 treesize of output 54 [2018-11-23 03:11:00,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-11-23 03:11:00,272 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-23 03:11:00,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2018-11-23 03:11:00,343 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 03:11:00,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 03:11:00,397 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,448 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-23 03:11:00,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 03:11:00,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 03:11:00,516 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,537 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:11:00,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-23 03:11:00,539 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,551 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:11:00,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 53 [2018-11-23 03:11:00,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-23 03:11:00,629 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2018-11-23 03:11:00,683 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-11-23 03:11:00,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-23 03:11:00,733 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:00,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-23 03:11:00,774 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-23 03:11:00,802 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 03:11:00,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-23 03:11:00,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 03:11:00,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 03:11:00,888 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:74, output treesize:85 [2018-11-23 03:11:00,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2018-11-23 03:11:00,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:00,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:00,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-11-23 03:11:00,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 03:11:01,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-11-23 03:11:01,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 03:11:01,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 03:11:01,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-23 03:11:01,189 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 03:11:01,220 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-23 03:11:01,278 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 03:11:01,305 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-23 03:11:01,327 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 11 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 03:11:01,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:11:01,364 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:30, output treesize:30 [2018-11-23 03:11:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:01,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:01,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-11-23 03:11:01,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 03:11:01,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-23 03:11:01,442 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-23 03:11:01,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2018-11-23 03:11:01,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-23 03:11:01,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 60 states and 72 transitions. Complement of second has 11 states. [2018-11-23 03:11:01,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:11:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 03:11:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-23 03:11:01,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-23 03:11:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-23 03:11:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:01,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-23 03:11:01,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:11:01,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 72 transitions. [2018-11-23 03:11:01,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:11:01,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 41 states and 49 transitions. [2018-11-23 03:11:01,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:11:01,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 03:11:01,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 49 transitions. [2018-11-23 03:11:01,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:01,586 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 03:11:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 49 transitions. [2018-11-23 03:11:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-11-23 03:11:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:11:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 03:11:01,588 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 03:11:01,588 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 03:11:01,588 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:11:01,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2018-11-23 03:11:01,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:11:01,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:01,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:01,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 03:11:01,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:01,590 INFO L794 eck$LassoCheckResult]: Stem: 689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 685#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 686#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 687#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 688#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 700#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 709#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 708#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 707#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 705#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 704#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 703#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-11-23 03:11:01,590 INFO L796 eck$LassoCheckResult]: Loop: 695#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 690#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 691#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 698#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 694#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 695#L558-3 [2018-11-23 03:11:01,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1969201019, now seen corresponding path program 3 times [2018-11-23 03:11:01,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:01,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:11:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:01,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:11:01,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:11:01,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:11:01,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 03:11:01,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:11:01,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:01,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 03:11:01,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:01,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 03:11:01,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-23 03:11:01,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 03:11:01,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 03:11:01,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 03:11:01,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-23 03:11:01,905 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 45 [2018-11-23 03:11:01,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 03:11:01,942 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,959 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:11:01,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-23 03:11:01,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 03:11:01,986 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:01,991 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 42 [2018-11-23 03:11:02,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 03:11:02,024 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-23 03:11:02,039 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,047 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:11:02,061 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:11:02,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:11:02,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 03:11:02,088 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:88, output treesize:70 [2018-11-23 03:11:02,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 39 [2018-11-23 03:11:02,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 03:11:02,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-23 03:11:02,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:02,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 58 [2018-11-23 03:11:02,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:02,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2018-11-23 03:11:02,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:02,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-23 03:11:02,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:11:02,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 03:11:02,228 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:69 [2018-11-23 03:11:02,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 03:11:02,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 03:11:02,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:02,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 03:11:02,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 03:11:02,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-23 03:11:02,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 03:11:02,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:11:02,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:11:02,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:17 [2018-11-23 03:11:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:02,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:11:02,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 03:11:02,382 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:02,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:02,382 INFO L82 PathProgramCache]: Analyzing trace with hash 45965688, now seen corresponding path program 3 times [2018-11-23 03:11:02,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:02,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:02,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:02,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:02,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:02,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 03:11:02,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:11:02,482 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-23 03:11:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:02,782 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 03:11:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:11:02,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2018-11-23 03:11:02,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:11:02,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 26 transitions. [2018-11-23 03:11:02,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 03:11:02,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 03:11:02,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-23 03:11:02,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:11:02,788 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 03:11:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-23 03:11:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-11-23 03:11:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:11:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 03:11:02,789 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 03:11:02,790 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 03:11:02,790 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:11:02,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-23 03:11:02,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 03:11:02,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:11:02,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:11:02,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:11:02,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 03:11:02,791 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 818#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y := main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem8, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 <= 0; 819#L555 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 <= 0; 820#L555-2 assume !test_fun_#t~short7;havoc test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 821#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 825#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 826#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 833#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 829#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 830#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 823#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 824#L559 assume test_fun_#t~mem9 > test_fun_#t~mem10;havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 827#L559-2 [2018-11-23 03:11:02,791 INFO L796 eck$LassoCheckResult]: Loop: 827#L559-2 call test_fun_#t~mem15 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem15, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem15; 828#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 835#L558-1 assume !!!(0 == test_fun_#t~mem8);havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 834#L559 assume !(test_fun_#t~mem9 > test_fun_#t~mem10);havoc test_fun_#t~mem10;havoc test_fun_#t~mem9;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 832#L562 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem14; 827#L559-2 [2018-11-23 03:11:02,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1913288219, now seen corresponding path program 2 times [2018-11-23 03:11:02,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:02,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:11:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:02,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:11:02,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46601e17-f5fc-4c3d-bd6d-b75506317b74/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:11:02,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:11:03,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:11:03,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:11:03,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:11:03,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:03,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 03:11:03,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:03,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:03,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 03:11:03,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-23 03:11:03,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:03,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-11-23 03:11:03,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:03,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-23 03:11:03,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-11-23 03:11:03,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:03,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 48 [2018-11-23 03:11:03,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:11:03,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 03:11:03,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:18 [2018-11-23 03:11:03,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 03:11:03,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 03:11:03,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 03:11:03,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:11:03,181 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-23 03:11:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:11:03,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:11:03,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-23 03:11:03,198 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:11:03,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:11:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash 61511628, now seen corresponding path program 4 times [2018-11-23 03:11:03,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:11:03,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:11:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:03,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:11:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:11:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:11:03,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:11:03,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:11:03,284 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-11-23 03:11:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:11:03,338 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 03:11:03,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:11:03,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-11-23 03:11:03,339 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:11:03,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-11-23 03:11:03,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:11:03,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:11:03,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:11:03,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:11:03,339 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:11:03,340 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:11:03,340 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:11:03,340 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:11:03,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:11:03,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:11:03,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:11:03,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:11:03 BoogieIcfgContainer [2018-11-23 03:11:03,344 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:11:03,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:11:03,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:11:03,344 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:11:03,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:10:54" (3/4) ... [2018-11-23 03:11:03,347 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:11:03,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:11:03,347 INFO L168 Benchmark]: Toolchain (without parser) took 9553.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 403.2 MB). Free memory was 951.1 MB in the beginning and 980.0 MB in the end (delta: -28.9 MB). Peak memory consumption was 374.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:03,348 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:11:03,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:03,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:03,349 INFO L168 Benchmark]: Boogie Preprocessor took 18.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:11:03,349 INFO L168 Benchmark]: RCFGBuilder took 195.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:03,349 INFO L168 Benchmark]: BuchiAutomizer took 8956.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 980.0 MB in the end (delta: 142.6 MB). Peak memory consumption was 385.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:11:03,349 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:11:03,351 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8956.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 980.0 MB in the end (delta: 142.6 MB). Peak memory consumption was 385.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 980.0 MB. 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.0s. Construction of modules took 0.1s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 111 SDslu, 43 SDs, 0 SdLazy, 179 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital551 mio100 ax104 hnf100 lsp93 ukn46 mio100 lsp38 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf101 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 109ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...