./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/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 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:27:37,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:27:37,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:27:37,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:27:37,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:27:37,564 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:27:37,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:27:37,566 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:27:37,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:27:37,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:27:37,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:27:37,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:27:37,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:27:37,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:27:37,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:27:37,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:27:37,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:27:37,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:27:37,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:27:37,576 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:27:37,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:27:37,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:27:37,579 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:27:37,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:27:37,579 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:27:37,580 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:27:37,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:27:37,581 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:27:37,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:27:37,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:27:37,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:27:37,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:27:37,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:27:37,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:27:37,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:27:37,585 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:27:37,585 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 21:27:37,595 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:27:37,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:27:37,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:27:37,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:27:37,596 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:27:37,597 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:27:37,597 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:27:37,597 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:27:37,597 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:27:37,597 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:27:37,597 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:27:37,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:27:37,598 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:27:37,598 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:27:37,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:27:37,598 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:27:37,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:27:37,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:27:37,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:27:37,599 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:27:37,599 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:27:37,599 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:27:37,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:27:37,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:27:37,599 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:27:37,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:27:37,600 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:27:37,600 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:27:37,601 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:27:37,601 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_6c3a5851-0526-409e-8629-596c69ba079b/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 -> 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 [2018-11-22 21:27:37,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:27:37,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:27:37,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:27:37,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:27:37,633 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:27:37,634 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-22 21:27:37,670 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/data/ca4f3a9f1/8c035e666d5448dfae476fbfd531da6b/FLAG360ec80ca [2018-11-22 21:27:38,000 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:27:38,001 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-22 21:27:38,012 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/data/ca4f3a9f1/8c035e666d5448dfae476fbfd531da6b/FLAG360ec80ca [2018-11-22 21:27:38,023 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/data/ca4f3a9f1/8c035e666d5448dfae476fbfd531da6b [2018-11-22 21:27:38,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:27:38,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:27:38,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:27:38,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:27:38,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:27:38,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388bc786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38, skipping insertion in model container [2018-11-22 21:27:38,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:27:38,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:27:38,256 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:27:38,265 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:27:38,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:27:38,355 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:27:38,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38 WrapperNode [2018-11-22 21:27:38,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:27:38,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:27:38,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:27:38,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:27:38,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:27:38,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:27:38,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:27:38,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:27:38,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... [2018-11-22 21:27:38,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:27:38,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:27:38,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:27:38,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:27:38,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c3a5851-0526-409e-8629-596c69ba079b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:27:38,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:27:38,652 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:27:38,652 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 21:27:38,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:38 BoogieIcfgContainer [2018-11-22 21:27:38,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:27:38,653 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:27:38,653 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:27:38,657 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:27:38,658 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:27:38,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:27:38" (1/3) ... [2018-11-22 21:27:38,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d96e416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:27:38, skipping insertion in model container [2018-11-22 21:27:38,659 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:27:38,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:38" (2/3) ... [2018-11-22 21:27:38,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d96e416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:27:38, skipping insertion in model container [2018-11-22 21:27:38,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:27:38,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:38" (3/3) ... [2018-11-22 21:27:38,661 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-22 21:27:38,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:27:38,705 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:27:38,705 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:27:38,705 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:27:38,705 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:27:38,705 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:27:38,706 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:27:38,706 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:27:38,706 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:27:38,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-22 21:27:38,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:27:38,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:27:38,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:27:38,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:27:38,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:27:38,751 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:27:38,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-22 21:27:38,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:27:38,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:27:38,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:27:38,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:27:38,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:27:38,760 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 12#L558-4true [2018-11-22 21:27:38,760 INFO L796 eck$LassoCheckResult]: Loop: 12#L558-4true call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 6#L558true assume !main_#t~short10; 9#L558-2true assume !!main_#t~short10;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 12#L558-4true [2018-11-22 21:27:38,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-22 21:27:38,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:38,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:38,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:38,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:27:38,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:38,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2018-11-22 21:27:38,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:38,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:38,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:38,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:27:38,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:27:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:27:38,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:27:38,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:27:38,932 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 21:27:38,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:27:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:27:38,943 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-11-22 21:27:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:27:38,972 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-22 21:27:38,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:27:38,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-22 21:27:38,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:27:38,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 6 states and 7 transitions. [2018-11-22 21:27:38,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-22 21:27:38,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-22 21:27:38,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2018-11-22 21:27:38,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:27:38,979 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-22 21:27:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2018-11-22 21:27:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-11-22 21:27:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-22 21:27:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-22 21:27:39,003 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-22 21:27:39,003 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-22 21:27:39,003 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:27:39,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2018-11-22 21:27:39,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:27:39,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:27:39,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:27:39,004 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:27:39,004 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:27:39,004 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 31#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 32#L558-4 [2018-11-22 21:27:39,004 INFO L796 eck$LassoCheckResult]: Loop: 32#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 33#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 34#L558-2 assume !!main_#t~short10;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 32#L558-4 [2018-11-22 21:27:39,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-22 21:27:39,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:39,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:39,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:27:39,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:39,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2018-11-22 21:27:39,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:39,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:27:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:39,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2018-11-22 21:27:39,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:39,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:39,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:27:39,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:39,246 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-22 21:27:39,529 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-22 21:27:39,641 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-22 21:27:39,651 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:27:39,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:27:39,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:27:39,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:27:39,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:27:39,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:27:39,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:27:39,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:27:39,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-22 21:27:39,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:27:39,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:27:39,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,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-22 21:27:39,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:39,984 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-22 21:27:40,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:40,459 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:27:40,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:27:40,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,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-22 21:27:40,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:40,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:40,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:40,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,536 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:27:40,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,538 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:27:40,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:40,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:40,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:40,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:40,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:40,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:40,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:40,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:40,599 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:27:40,605 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:27:40,605 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 21:27:40,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:27:40,609 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-22 21:27:40,609 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:27:40,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] [2018-11-22 21:27:40,767 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-22 21:27:40,775 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:27:40,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:27:40,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:27:40,837 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 29 treesize of output 28 [2018-11-22 21:27:40,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:40,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:40,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-11-22 21:27:40,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-22 21:27:40,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:40,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:40,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:40,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:40,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-22 21:27:40,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:27:40,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:27:40,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:27:40,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:27:40,919 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-22 21:27:40,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-22 21:27:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:27:40,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:27:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:27:40,974 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-22 21:27:40,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-22 21:27:41,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 12 states and 14 transitions. Complement of second has 7 states. [2018-11-22 21:27:41,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 21:27:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:27:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-22 21:27:41,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-22 21:27:41,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:27:41,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-22 21:27:41,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:27:41,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-22 21:27:41,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:27:41,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-22 21:27:41,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:27:41,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2018-11-22 21:27:41,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-22 21:27:41,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-22 21:27:41,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2018-11-22 21:27:41,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:27:41,036 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-22 21:27:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2018-11-22 21:27:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-11-22 21:27:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-22 21:27:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-11-22 21:27:41,037 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-22 21:27:41,037 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-22 21:27:41,037 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:27:41,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2018-11-22 21:27:41,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 21:27:41,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:27:41,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:27:41,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 21:27:41,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 21:27:41,038 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 258#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 259#L558-4 [2018-11-22 21:27:41,038 INFO L796 eck$LassoCheckResult]: Loop: 259#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 260#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 261#L558-2 assume !!main_#t~short10;havoc main_#t~mem8;havoc main_#t~short10;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 259#L558-4 [2018-11-22 21:27:41,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-22 21:27:41,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:41,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:41,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:27:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:41,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 2 times [2018-11-22 21:27:41,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:41,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:41,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:27:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:41,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash 889511698, now seen corresponding path program 1 times [2018-11-22 21:27:41,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:27:41,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:27:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:41,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:27:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:27:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:27:41,199 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-22 21:27:41,405 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-22 21:27:41,480 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:27:41,480 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:27:41,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:27:41,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:27:41,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:27:41,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:27:41,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:27:41,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:27:41,481 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-22 21:27:41,481 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:27:41,481 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:27:41,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-22 21:27:41,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-22 21:27:41,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-22 21:27:41,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:41,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 21:27:42,069 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:27:42,069 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:27:42,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:42,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:42,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:42,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:42,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:42,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:42,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:42,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:42,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:42,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:42,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:42,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:27:42,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:42,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:42,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:42,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:27:42,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:27:42,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:42,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:42,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:42,077 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:27:42,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:42,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:42,078 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:27:42,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:42,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:42,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:42,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:42,083 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:27:42,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:42,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:42,084 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:27:42,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:42,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:42,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:42,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:42,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:42,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:42,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:42,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:42,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:42,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:27:42,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 21:27:42,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:27:42,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:27:42,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:27:42,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:27:42,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:27:42,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:27:42,104 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:27:42,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:27:42,108 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 21:27:42,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:27:42,109 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-22 21:27:42,109 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:27:42,109 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2018-11-22 21:27:42,220 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-22 21:27:42,225 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:27:42,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:27:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:27:42,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:27:42,255 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 29 treesize of output 28 [2018-11-22 21:27:42,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:42,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:42,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-11-22 21:27:42,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-22 21:27:42,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:42,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:42,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:42,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:27:42,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-22 21:27:42,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:27:42,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:27:42,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:27:42,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:27:42,320 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-22 21:27:42,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-22 21:27:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:27:42,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:27:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:27:42,397 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-22 21:27:42,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-11-22 21:27:42,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2018-11-22 21:27:42,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 21:27:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:27:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2018-11-22 21:27:42,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-22 21:27:42,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:27:42,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-22 21:27:42,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:27:42,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-22 21:27:42,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:27:42,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-22 21:27:42,438 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:27:42,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-22 21:27:42,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 21:27:42,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 21:27:42,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 21:27:42,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:27:42,438 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:27:42,438 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:27:42,438 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:27:42,438 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 21:27:42,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:27:42,439 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:27:42,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 21:27:42,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:27:42 BoogieIcfgContainer [2018-11-22 21:27:42,443 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:27:42,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:27:42,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:27:42,443 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:27:42,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:38" (3/4) ... [2018-11-22 21:27:42,446 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:27:42,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:27:42,447 INFO L168 Benchmark]: Toolchain (without parser) took 4420.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.3 MB). Free memory was 952.1 MB in the beginning and 1.2 GB in the end (delta: -257.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:27:42,447 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:27:42,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:27:42,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:27:42,448 INFO L168 Benchmark]: Boogie Preprocessor took 15.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:27:42,448 INFO L168 Benchmark]: RCFGBuilder took 249.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:27:42,448 INFO L168 Benchmark]: BuchiAutomizer took 3789.86 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -157.0 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:27:42,449 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:27:42,451 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 249.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3789.86 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -157.0 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 13 SDslu, 8 SDs, 0 SdLazy, 24 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax105 hnf100 lsp89 ukn55 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 0 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...