./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/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 7ec9a57be1d36dda380e5a4e58b869e7f4707b06 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:59:39,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:59:39,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:59:39,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:59:39,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:59:39,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:59:39,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:59:39,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:59:39,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:59:39,598 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:59:39,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:59:39,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:59:39,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:59:39,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:59:39,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:59:39,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:59:39,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:59:39,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:59:39,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:59:39,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:59:39,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:59:39,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:59:39,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:59:39,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:59:39,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:59:39,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:59:39,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:59:39,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:59:39,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:59:39,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:59:39,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:59:39,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:59:39,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:59:39,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:59:39,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:59:39,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:59:39,615 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:59:39,625 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:59:39,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:59:39,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:59:39,627 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:59:39,627 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:59:39,627 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:59:39,627 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:59:39,627 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:59:39,628 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:59:39,628 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:59:39,628 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:59:39,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:59:39,628 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:59:39,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:59:39,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:59:39,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:59:39,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:59:39,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:59:39,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:59:39,629 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:59:39,629 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:59:39,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:59:39,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:59:39,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:59:39,630 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:59:39,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:59:39,630 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:59:39,630 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:59:39,631 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:59:39,631 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_ab2ddb51-530f-4592-98a4-b60ec724276d/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 -> 7ec9a57be1d36dda380e5a4e58b869e7f4707b06 [2018-11-18 13:59:39,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:59:39,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:59:39,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:59:39,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:59:39,668 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:59:39,669 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i [2018-11-18 13:59:39,713 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/data/3f64a55c6/f961105d7d3c4f468aaaa1af289e0a37/FLAG52e947033 [2018-11-18 13:59:40,120 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:59:40,121 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/sv-benchmarks/c/termination-recursive-malloc/chunk2_true-termination.c.i [2018-11-18 13:59:40,125 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/data/3f64a55c6/f961105d7d3c4f468aaaa1af289e0a37/FLAG52e947033 [2018-11-18 13:59:40,134 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/bin-2019/uautomizer/data/3f64a55c6/f961105d7d3c4f468aaaa1af289e0a37 [2018-11-18 13:59:40,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:59:40,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:59:40,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:59:40,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:59:40,140 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:59:40,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415830c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40, skipping insertion in model container [2018-11-18 13:59:40,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:59:40,168 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:59:40,284 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:59:40,293 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:59:40,311 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:59:40,324 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:59:40,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40 WrapperNode [2018-11-18 13:59:40,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:59:40,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:59:40,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:59:40,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:59:40,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:59:40,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:59:40,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:59:40,356 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:59:40,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... [2018-11-18 13:59:40,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:59:40,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:59:40,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:59:40,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:59:40,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab2ddb51-530f-4592-98a4-b60ec724276d/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-18 13:59:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:59:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure chunk [2018-11-18 13:59:40,454 INFO L138 BoogieDeclarations]: Found implementation of procedure chunk [2018-11-18 13:59:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:59:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:59:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:59:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:59:40,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:59:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:59:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:59:40,640 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:59:40,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:59:40 BoogieIcfgContainer [2018-11-18 13:59:40,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:59:40,641 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:59:40,642 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:59:40,644 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:59:40,645 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:59:40,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:59:40" (1/3) ... [2018-11-18 13:59:40,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fdc4a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:59:40, skipping insertion in model container [2018-11-18 13:59:40,646 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:59:40,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:59:40" (2/3) ... [2018-11-18 13:59:40,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fdc4a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:59:40, skipping insertion in model container [2018-11-18 13:59:40,647 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:59:40,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:59:40" (3/3) ... [2018-11-18 13:59:40,648 INFO L375 chiAutomizerObserver]: Analyzing ICFG chunk2_true-termination.c.i [2018-11-18 13:59:40,683 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:59:40,683 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:59:40,683 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:59:40,683 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:59:40,684 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:59:40,684 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:59:40,684 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:59:40,684 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:59:40,684 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:59:40,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 13:59:40,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:59:40,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:59:40,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:59:40,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:59:40,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:59:40,724 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:59:40,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 13:59:40,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 13:59:40,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:59:40,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:59:40,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 13:59:40,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 13:59:40,731 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet15, main_#t~nondet16, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_~data~0.base, main_~data~0.offset, main_~p0~1.base, main_~p0~1.offset, main_~p1~1.base, main_~p1~1.offset, main_~p2~1.base, main_~p2~1.offset, main_~p3~1.base, main_~p3~1.offset, main_~i~0, main_~upper~0, main_~p1_new~0.base, main_~p1_new~0.offset, main_~p2_new~0.base, main_~p2_new~0.offset;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(32);main_~data~0.base, main_~data~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p0~1.base, main_~p0~1.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p1~1.base, main_~p1~1.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(4);main_~p2~1.base, main_~p2~1.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p3~1.base, main_~p3~1.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := main_#t~nondet15;havoc main_#t~nondet15;main_~upper~0 := main_#t~nondet16;havoc main_#t~nondet16; 8#L42true assume !(main_~i~0 >= main_~upper~0);call write~int(main_~i~0, main_~p0~1.base, main_~p0~1.offset, 4);call write~int(main_~upper~0, main_~p3~1.base, main_~p3~1.offset, 4);call write~$Pointer$(main_~p0~1.base, main_~p0~1.offset, main_~data~0.base, main_~data~0.offset, 8);call write~$Pointer$(main_~p1~1.base, main_~p1~1.offset, main_~data~0.base, 8 + main_~data~0.offset, 8);call write~$Pointer$(main_~p2~1.base, main_~p2~1.offset, main_~data~0.base, 16 + main_~data~0.offset, 8);call write~$Pointer$(main_~p3~1.base, main_~p3~1.offset, main_~data~0.base, 24 + main_~data~0.offset, 8); 15#L57true call chunk(main_~data~0.base, main_~data~0.offset);< 13#chunkENTRYtrue [2018-11-18 13:59:40,731 INFO L796 eck$LassoCheckResult]: Loop: 13#chunkENTRYtrue ~data.base, ~data.offset := #in~data.base, #in~data.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~data.base, ~data.offset, 8);~p0~0.base, ~p0~0.offset := #t~mem1.base, #t~mem1.offset;havoc #t~mem1.base, #t~mem1.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~data.base, 8 + ~data.offset, 8);~p1~0.base, ~p1~0.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset;call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~data.base, 16 + ~data.offset, 8);~p2~0.base, ~p2~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~data.base, 24 + ~data.offset, 8);~p3~0.base, ~p3~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call #t~mem5 := read~int(~p0~0.base, ~p0~0.offset, 4);call #t~mem6 := read~int(~p3~0.base, ~p3~0.offset, 4); 6#L14true assume !(#t~mem5 >= #t~mem6);havoc #t~mem5;havoc #t~mem6;call #t~mem7 := read~int(~p0~0.base, ~p0~0.offset, 4);#t~post8 := #t~mem7;call write~int(1 + #t~post8, ~p0~0.base, ~p0~0.offset, 4);havoc #t~post8;havoc #t~mem7;call ULTIMATE.dealloc(~p1~0.base, ~p1~0.offset);call write~$Pointer$(~p2~0.base, ~p2~0.offset, ~data.base, 8 + ~data.offset, 8);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~data.base, 16 + ~data.offset, 8); 5#L25true call chunk(~data.base, ~data.offset);< 13#chunkENTRYtrue [2018-11-18 13:59:40,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:59:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1141163, now seen corresponding path program 1 times [2018-11-18 13:59:40,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:59:40,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:59:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:59:40,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:59:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:59:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:59:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:59:40,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:59:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash 29935, now seen corresponding path program 1 times [2018-11-18 13:59:40,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:59:40,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:59:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:59:40,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:59:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:59:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:59:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:59:40,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:59:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -363351291, now seen corresponding path program 1 times [2018-11-18 13:59:40,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:59:40,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:59:40,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:59:40,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:59:40,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:59:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:59:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:59:41,423 WARN L180 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 121 [2018-11-18 13:59:41,579 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-18 13:59:41,745 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 13:59:42,557 WARN L180 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 143 [2018-11-18 13:59:42,871 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2018-11-18 13:59:43,218 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-11-18 13:59:43,352 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-18 13:59:43,361 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:59:43,362 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:59:43,362 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:59:43,362 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:59:43,362 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:59:43,362 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:59:43,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:59:43,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:59:43,363 INFO L131 ssoRankerPreferences]: Filename of dumped script: chunk2_true-termination.c.i_Iteration1_Lasso [2018-11-18 13:59:43,363 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:59:43,363 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:59:43,383 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-18 13:59:43,388 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-18 13:59:43,389 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-18 13:59:43,390 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-18 13:59:43,392 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-18 13:59:43,393 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-18 13:59:43,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:59:43,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:59:43,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:59:43,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:59:43,400 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-18 13:59:43,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:59:43,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:59:43,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:59:43,413 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-18 13:59:43,415 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-18 13:59:43,416 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-18 13:59:43,418 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-18 13:59:43,419 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-18 13:59:43,420 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-18 13:59:43,421 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-18 13:59:43,422 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-18 13:59:43,424 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-18 13:59:43,425 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-18 13:59:43,426 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-18 13:59:43,427 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-18 13:59:43,428 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-18 13:59:43,430 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-18 13:59:43,431 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-18 13:59:43,432 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-18 13:59:43,433 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-18 13:59:43,435 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-18 13:59:43,435 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-18 13:59:43,438 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-18 13:59:43,439 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-18 13:59:43,440 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-18 13:59:43,441 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-18 13:59:43,442 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-18 13:59:43,444 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-18 13:59:43,721 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 97 [2018-11-18 13:59:44,010 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2018-11-18 13:59:44,011 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-18 13:59:44,012 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-18 13:59:44,013 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-18 13:59:44,014 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-18 13:59:44,015 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-18 13:59:44,016 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-18 13:59:44,017 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-18 13:59:44,018 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-18 13:59:44,019 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-18 13:59:44,020 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-18 13:59:44,021 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-18 13:59:44,022 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-18 13:59:44,023 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-18 13:59:44,024 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-18 13:59:44,025 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-18 13:59:44,025 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-18 13:59:44,026 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-18 13:59:44,027 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-18 13:59:44,028 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-18 13:59:44,029 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-18 13:59:44,030 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-18 13:59:44,031 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-18 13:59:44,032 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-18 13:59:44,034 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-18 13:59:44,459 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:59:44,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:59:44,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-18 13:59:44,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,468 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-18 13:59:44,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:59:44,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:59:44,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:59:44,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,477 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-18 13:59:44,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,479 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-18 13:59:44,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,481 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-18 13:59:44,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,483 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-18 13:59:44,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:59:44,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:59:44,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,488 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-18 13:59:44,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,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-18 13:59:44,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,492 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-18 13:59:44,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:59:44,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,503 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-18 13:59:44,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,505 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-18 13:59:44,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,507 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-18 13:59:44,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,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-18 13:59:44,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,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-18 13:59:44,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,514 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-18 13:59:44,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,516 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-18 13:59:44,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,518 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-18 13:59:44,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,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-18 13:59:44,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,523 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-18 13:59:44,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,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-18 13:59:44,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,527 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-18 13:59:44,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,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-18 13:59:44,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,531 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-18 13:59:44,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,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-18 13:59:44,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:59:44,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,541 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-18 13:59:44,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,543 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-18 13:59:44,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:59:44,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:59:44,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,548 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-18 13:59:44,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,550 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-18 13:59:44,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,553 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-18 13:59:44,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,555 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-18 13:59:44,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,557 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-18 13:59:44,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,558 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-18 13:59:44,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,560 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-18 13:59:44,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:59:44,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:59:44,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:59:44,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,562 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-18 13:59:44,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:59:44,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:59:44,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,575 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-18 13:59:44,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:59:44,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:59:44,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:59:44,583 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-18 13:59:44,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:59:44,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:59:44,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:59:44,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:59:44,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:59:44,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:59:44,616 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:59:44,628 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:59:44,628 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 13:59:44,629 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:59:44,630 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:59:44,631 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:59:44,631 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) chunk_#in~data.offset)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) chunk_#in~data.offset))_1, v_rep(let ((.cse0 (+ chunk_#in~data.offset 24))) (select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) .cse0)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) .cse0)))_1) = -1*v_rep(select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) chunk_#in~data.offset)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) chunk_#in~data.offset))_1 + 1*v_rep(let ((.cse0 (+ chunk_#in~data.offset 24))) (select (select #memory_int (select (select #memory_$Pointer$.base chunk_#in~data.base) .cse0)) (select (select #memory_$Pointer$.offset chunk_#in~data.base) .cse0)))_1 Supporting invariants [] [2018-11-18 13:59:44,697 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 13:59:44,701 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 13:59:44,701 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 13:59:44,701 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 13:59:44,702 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 13:59:44,703 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:59:44,703 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 13:59:44,703 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 13:59:44,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:59:44,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 13:59:44,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 13:59:44,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:59:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:59:44,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:59:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:59:44,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:59:44,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 107 [2018-11-18 13:59:44,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,837 INFO L477 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 107 treesize of output 129 [2018-11-18 13:59:44,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 164 [2018-11-18 13:59:44,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:59:44,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:59:44,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:59:44,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 105 [2018-11-18 13:59:44,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,927 INFO L477 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 105 treesize of output 127 [2018-11-18 13:59:44,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 164 [2018-11-18 13:59:44,945 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:59:44,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:59:44,968 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:59:44,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:44,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 124 [2018-11-18 13:59:45,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:45,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:45,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:45,007 INFO L477 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 94 treesize of output 107 [2018-11-18 13:59:45,008 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 13:59:45,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:59:45,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2018-11-18 13:59:45,037 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:59:45,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:59:45,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:59:45,072 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:140, output treesize:172 [2018-11-18 13:59:45,093 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-18 13:59:45,103 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:59:45,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-18 13:59:45,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 31 states and 35 transitions. Complement of second has 16 states. [2018-11-18 13:59:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 13:59:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:59:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 13:59:45,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-18 13:59:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:59:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 13:59:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:59:45,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 13:59:45,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:59:45,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-18 13:59:45,192 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:59:45,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-18 13:59:45,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:59:45,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:59:45,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:59:45,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:59:45,196 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:59:45,196 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:59:45,196 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:59:45,196 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:59:45,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:59:45,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:59:45,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:59:45,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:59:45 BoogieIcfgContainer [2018-11-18 13:59:45,200 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:59:45,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:59:45,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:59:45,201 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:59:45,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:59:40" (3/4) ... [2018-11-18 13:59:45,204 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:59:45,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:59:45,205 INFO L168 Benchmark]: Toolchain (without parser) took 5068.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 150.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:59:45,205 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:59:45,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:59:45,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.71 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:59:45,206 INFO L168 Benchmark]: Boogie Preprocessor took 63.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -230.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:59:45,206 INFO L168 Benchmark]: RCFGBuilder took 221.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:59:45,207 INFO L168 Benchmark]: BuchiAutomizer took 4559.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Peak memory consumption was 167.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:59:45,207 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:59:45,209 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.71 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -230.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 221.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4559.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Peak memory consumption was 167.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[#memory_$Pointer$[data][data]][#memory_$Pointer$[data][data]] + unknown-#memory_int-unknown[#memory_$Pointer$[data][data + 24]][#memory_$Pointer$[data][data + 24]] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 8 SDslu, 3 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital571 mio100 ax100 hnf99 lsp98 ukn48 mio100 lsp25 div100 bol100 ite100 ukn100 eq192 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...