./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/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 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:30:23,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:30:23,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:30:23,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:30:23,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:30:23,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:30:23,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:30:23,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:30:23,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:30:23,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:30:23,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:30:23,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:30:23,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:30:23,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:30:23,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:30:23,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:30:23,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:30:23,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:30:23,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:30:23,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:30:23,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:30:23,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:30:23,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:30:23,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:30:23,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:30:23,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:30:23,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:30:23,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:30:23,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:30:23,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:30:23,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:30:23,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:30:23,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:30:23,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:30:23,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:30:23,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:30:23,534 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:30:23,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:30:23,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:30:23,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:30:23,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:30:23,546 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:30:23,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:30:23,546 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:30:23,546 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:30:23,546 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:30:23,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:30:23,547 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:30:23,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:30:23,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:30:23,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:30:23,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:30:23,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:30:23,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:30:23,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:30:23,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:30:23,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:30:23,548 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:30:23,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:30:23,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:30:23,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:30:23,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:30:23,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:30:23,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:30:23,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:30:23,550 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:30:23,550 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_e9ee7912-4f07-446f-a007-6d86c8a623fc/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 -> 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 [2018-11-28 13:30:23,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:30:23,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:30:23,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:30:23,584 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:30:23,584 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:30:23,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-28 13:30:23,622 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/data/ee073bff9/4fff97d844934f20b2f822dec320a9a2/FLAG95b939077 [2018-11-28 13:30:24,031 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:30:24,032 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/sv-benchmarks/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-28 13:30:24,038 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/data/ee073bff9/4fff97d844934f20b2f822dec320a9a2/FLAG95b939077 [2018-11-28 13:30:24,046 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/bin-2019/uautomizer/data/ee073bff9/4fff97d844934f20b2f822dec320a9a2 [2018-11-28 13:30:24,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:30:24,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:30:24,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:30:24,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:30:24,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:30:24,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594db415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24, skipping insertion in model container [2018-11-28 13:30:24,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:30:24,083 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:30:24,258 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:30:24,304 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:30:24,332 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:30:24,353 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:30:24,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24 WrapperNode [2018-11-28 13:30:24,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:30:24,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:30:24,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:30:24,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:30:24,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:30:24,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:30:24,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:30:24,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:30:24,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... [2018-11-28 13:30:24,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:30:24,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:30:24,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:30:24,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:30:24,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e9ee7912-4f07-446f-a007-6d86c8a623fc/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-28 13:30:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:30:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:30:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:30:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:30:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:30:24,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:30:24,656 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:30:24,656 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:30:24,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:30:24 BoogieIcfgContainer [2018-11-28 13:30:24,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:30:24,657 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:30:24,657 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:30:24,660 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:30:24,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:30:24,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:30:24" (1/3) ... [2018-11-28 13:30:24,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a68451c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:30:24, skipping insertion in model container [2018-11-28 13:30:24,662 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:30:24,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:30:24" (2/3) ... [2018-11-28 13:30:24,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a68451c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:30:24, skipping insertion in model container [2018-11-28 13:30:24,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:30:24,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:30:24" (3/3) ... [2018-11-28 13:30:24,664 INFO L375 chiAutomizerObserver]: Analyzing ICFG Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2018-11-28 13:30:24,708 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:30:24,709 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:30:24,709 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:30:24,709 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:30:24,709 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:30:24,709 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:30:24,710 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:30:24,710 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:30:24,710 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:30:24,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 13:30:24,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:30:24,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:30:24,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:30:24,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:30:24,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:30:24,746 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:30:24,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 13:30:24,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 13:30:24,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:30:24,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:30:24,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:30:24,748 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:30:24,755 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 5#L556true assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 7#L556-2true assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~short9;havoc subxy_#t~mem8; 6#L559-3true [2018-11-28 13:30:24,755 INFO L796 eck$LassoCheckResult]: Loop: 6#L559-3true call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 3#L559-1true assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem11;havoc subxy_#t~post12;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem13;havoc subxy_#t~post14; 6#L559-3true [2018-11-28 13:30:24,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2018-11-28 13:30:24,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:24,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:24,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:24,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:30:24,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:24,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:24,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1542, now seen corresponding path program 1 times [2018-11-28 13:30:24,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:24,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:24,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:30:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:24,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2018-11-28 13:30:24,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:24,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:30:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:25,508 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2018-11-28 13:30:25,644 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-28 13:30:25,655 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:30:25,656 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:30:25,656 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:30:25,656 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:30:25,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:30:25,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:30:25,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:30:25,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:30:25,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 13:30:25,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:30:25,658 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:30:25,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-28 13:30:25,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-28 13:30:25,682 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-28 13:30:25,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-28 13:30:25,686 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-28 13:30:25,687 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-28 13:30:26,009 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-28 13:30:26,074 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-28 13:30:26,075 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-28 13:30:26,076 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-28 13:30:26,077 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-28 13:30:26,078 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-28 13:30:26,079 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-28 13:30:26,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:26,082 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-28 13:30:26,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:26,084 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-28 13:30:26,085 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-28 13:30:26,087 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-28 13:30:26,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:26,090 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-28 13:30:26,092 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-28 13:30:26,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:26,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:26,096 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-28 13:30:26,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:26,099 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-28 13:30:26,100 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-28 13:30:26,102 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-28 13:30:26,450 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:30:26,454 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:30:26,456 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-28 13:30:26,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:30:26,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:30:26,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:30:26,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,462 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-28 13:30:26,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:30:26,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:30:26,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:30:26,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,466 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-28 13:30:26,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:30:26,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:30:26,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:30:26,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,469 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-28 13:30:26,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:30:26,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:30:26,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:30:26,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,471 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-28 13:30:26,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:30:26,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:30:26,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:30:26,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:30:26,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:26,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:26,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,480 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-28 13:30:26,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,480 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:30:26,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,483 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:30:26,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:26,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,494 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-28 13:30:26,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:26,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:26,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,526 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-28 13:30:26,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,526 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:30:26,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,528 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:30:26,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:26,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,534 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-28 13:30:26,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:26,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:26,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:26,540 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-28 13:30:26,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:26,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:26,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:26,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:26,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:26,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:26,557 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:30:26,565 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:30:26,566 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:30:26,567 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:30:26,568 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:30:26,569 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:30:26,569 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 Supporting invariants [] [2018-11-28 13:30:26,672 INFO L297 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2018-11-28 13:30:26,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:30:26,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:30:26,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:30:26,741 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 13:30:26,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 13:30:26,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:30:26,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:30:26,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:30:26,753 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 9 [2018-11-28 13:30:26,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:30:26,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:30:26,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:30:26,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:30:26,767 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-11-28 13:30:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:30:26,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:30:26,784 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-28 13:30:26,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 13:30:26,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-28 13:30:26,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 32 states and 41 transitions. Complement of second has 9 states. [2018-11-28 13:30:26,862 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-28 13:30:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:30:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 13:30:26,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 13:30:26,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:30:26,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 13:30:26,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:30:26,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 13:30:26,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:30:26,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2018-11-28 13:30:26,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:30:26,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 15 transitions. [2018-11-28 13:30:26,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:30:26,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:30:26,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2018-11-28 13:30:26,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:30:26,871 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-28 13:30:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2018-11-28 13:30:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-11-28 13:30:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 13:30:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 13:30:26,887 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 13:30:26,888 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 13:30:26,888 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:30:26,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 13:30:26,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:30:26,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:30:26,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:30:26,889 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:30:26,889 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:30:26,889 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 243#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 250#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~short9;havoc subxy_#t~mem8; 251#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 244#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 245#L563-2 [2018-11-28 13:30:26,889 INFO L796 eck$LassoCheckResult]: Loop: 245#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 249#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem16;havoc subxy_#t~mem15;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post18;havoc subxy_#t~mem17;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem19;havoc subxy_#t~post20; 245#L563-2 [2018-11-28 13:30:26,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:26,889 INFO L82 PathProgramCache]: Analyzing trace with hash 889572332, now seen corresponding path program 1 times [2018-11-28 13:30:26,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:26,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:26,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:30:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:30:26,984 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-28 13:30:26,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:30:26,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:30:26,987 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:30:26,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-28 13:30:26,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:26,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:30:26,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:27,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:30:27,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:30:27,059 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 13:30:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:30:27,127 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-28 13:30:27,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:30:27,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-28 13:30:27,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:30:27,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 13 transitions. [2018-11-28 13:30:27,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 13:30:27,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 13:30:27,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-28 13:30:27,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:30:27,130 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-28 13:30:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-28 13:30:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-28 13:30:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 13:30:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 13:30:27,131 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 13:30:27,131 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 13:30:27,131 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:30:27,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 13:30:27,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 13:30:27,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:30:27,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:30:27,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 13:30:27,132 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 13:30:27,133 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.alloc(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.alloc(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.alloc(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.alloc(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 280#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 288#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~short9;havoc subxy_#t~mem8; 287#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 283#L559-1 assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem11;havoc subxy_#t~post12;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem13;havoc subxy_#t~post14; 284#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 281#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 282#L563-2 [2018-11-28 13:30:27,133 INFO L796 eck$LassoCheckResult]: Loop: 282#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 286#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem16;havoc subxy_#t~mem15;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post18;havoc subxy_#t~mem17;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem19;havoc subxy_#t~post20; 282#L563-2 [2018-11-28 13:30:27,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash 180521649, now seen corresponding path program 1 times [2018-11-28 13:30:27,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:27,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:27,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:30:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:27,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 2 times [2018-11-28 13:30:27,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:27,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:27,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:27,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:30:27,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:27,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1682613814, now seen corresponding path program 1 times [2018-11-28 13:30:27,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:30:27,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:30:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:27,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:30:27,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:30:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:30:27,855 WARN L180 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-11-28 13:30:28,055 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-28 13:30:28,057 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:30:28,057 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:30:28,057 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:30:28,057 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:30:28,057 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:30:28,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:30:28,058 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:30:28,058 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:30:28,058 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 13:30:28,058 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:30:28,058 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:30:28,061 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-28 13:30:28,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:28,072 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-28 13:30:28,072 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-28 13:30:28,377 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2018-11-28 13:30:28,461 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-28 13:30:28,463 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-28 13:30:28,468 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-28 13:30:28,469 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-28 13:30:28,470 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-28 13:30:28,471 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-28 13:30:28,472 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-28 13:30:28,474 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-28 13:30:28,475 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-28 13:30:28,476 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-28 13:30:28,478 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-28 13:30:28,479 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-28 13:30:28,480 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-28 13:30:28,481 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-28 13:30:28,484 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-28 13:30:28,485 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-28 13:30:28,486 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-28 13:30:28,487 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-28 13:30:28,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:30:28,489 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-28 13:30:28,490 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-28 13:30:28,506 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-28 13:30:28,507 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-28 13:30:28,508 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-28 13:30:28,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:30:28,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:30:28,814 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-28 13:30:28,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:30:28,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:30:28,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:30:28,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,817 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-28 13:30:28,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,820 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-28 13:30:28,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:30:28,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:30:28,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:30:28,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,822 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-28 13:30:28,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,822 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:30:28,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:30:28,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,828 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-28 13:30:28,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,828 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:30:28,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,829 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:30:28,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,833 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-28 13:30:28,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,837 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-28 13:30:28,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,842 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-28 13:30:28,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,845 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-28 13:30:28,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,849 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:30:28,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,850 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:30:28,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,855 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-28 13:30:28,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,863 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-28 13:30:28,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,877 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-28 13:30:28,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,882 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-28 13:30:28,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,885 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-28 13:30:28,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,885 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:30:28,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,886 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:30:28,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:30:28,890 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-28 13:30:28,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:30:28,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:30:28,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:30:28,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:30:28,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:30:28,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:30:28,906 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:30:28,916 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:30:28,916 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 13:30:28,917 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:30:28,918 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:30:28,918 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:30:28,919 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-28 13:30:29,040 INFO L297 tatePredicateManager]: 34 out of 37 supporting invariants were superfluous and have been removed [2018-11-28 13:30:29,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:30:29,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 13:30:29,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:30:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:30:29,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:30:29,092 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 13:30:29,097 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 13:30:29,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:30:29,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:30:29,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:30:29,109 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 9 [2018-11-28 13:30:29,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:30:29,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:30:29,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:30:29,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:30:29,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-11-28 13:30:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:30:29,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:30:29,159 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-28 13:30:29,159 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 13:30:29,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 13:30:29,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 12 states and 15 transitions. Complement of second has 5 states. [2018-11-28 13:30:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:30:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 13:30:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 13:30:29,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 13:30:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:30:29,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 13:30:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:30:29,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 13:30:29,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:30:29,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2018-11-28 13:30:29,189 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:30:29,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-28 13:30:29,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:30:29,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:30:29,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:30:29,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:30:29,189 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:30:29,189 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:30:29,189 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:30:29,189 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:30:29,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:30:29,189 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:30:29,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:30:29,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:30:29 BoogieIcfgContainer [2018-11-28 13:30:29,194 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:30:29,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:30:29,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:30:29,195 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:30:29,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:30:24" (3/4) ... [2018-11-28 13:30:29,197 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:30:29,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:30:29,198 INFO L168 Benchmark]: Toolchain (without parser) took 5149.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -122.5 MB). Peak memory consumption was 195.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:30:29,199 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:30:29,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:30:29,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.40 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-28 13:30:29,200 INFO L168 Benchmark]: Boogie Preprocessor took 15.60 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-28 13:30:29,200 INFO L168 Benchmark]: RCFGBuilder took 255.20 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:30:29,200 INFO L168 Benchmark]: BuchiAutomizer took 4536.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.1 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:30:29,201 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:30:29,203 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.40 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. * Boogie Preprocessor took 15.60 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. * RCFGBuilder took 255.20 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4536.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.1 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[i][i] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 24 SDslu, 16 SDs, 0 SdLazy, 44 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital779 mio100 ax102 hnf100 lsp95 ukn31 mio100 lsp34 div100 bol100 ite100 ukn100 eq192 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...