./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/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 18b42b65120149c30866fbc5b5479df029781f63 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:47:28,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:47:28,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:47:28,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:47:28,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:47:28,602 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:47:28,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:47:28,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:47:28,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:47:28,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:47:28,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:47:28,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:47:28,606 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:47:28,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:47:28,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:47:28,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:47:28,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:47:28,608 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:47:28,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:47:28,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:47:28,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:47:28,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:47:28,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:47:28,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:47:28,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:47:28,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:47:28,613 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:47:28,614 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:47:28,614 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:47:28,615 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:47:28,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:47:28,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:47:28,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:47:28,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:47:28,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:47:28,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:47:28,616 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 22:47:28,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:47:28,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:47:28,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:47:28,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:47:28,625 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:47:28,625 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 22:47:28,625 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 22:47:28,625 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 22:47:28,625 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 22:47:28,625 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 22:47:28,625 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 22:47:28,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 22:47:28,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:47:28,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:47:28,627 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 22:47:28,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:47:28,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 22:47:28,627 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 22:47:28,627 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 22:47:28,627 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_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2018-12-01 22:47:28,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:47:28,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:47:28,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:47:28,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:47:28,654 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:47:28,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-12-01 22:47:28,689 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/data/dc42da8cc/2de42232f3544c78ab1fabf872810eb5/FLAGcd698dfa6 [2018-12-01 22:47:29,144 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:47:29,145 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-12-01 22:47:29,149 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/data/dc42da8cc/2de42232f3544c78ab1fabf872810eb5/FLAGcd698dfa6 [2018-12-01 22:47:29,514 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/bin-2019/uautomizer/data/dc42da8cc/2de42232f3544c78ab1fabf872810eb5 [2018-12-01 22:47:29,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:47:29,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:47:29,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:47:29,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:47:29,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:47:29,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6304a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29, skipping insertion in model container [2018-12-01 22:47:29,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:47:29,541 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:47:29,633 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:47:29,639 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:47:29,648 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:47:29,656 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:47:29,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29 WrapperNode [2018-12-01 22:47:29,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:47:29,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:47:29,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:47:29,657 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:47:29,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:47:29,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:47:29,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:47:29,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:47:29,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... [2018-12-01 22:47:29,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:47:29,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:47:29,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:47:29,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:47:29,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c8e2d7a-922b-47f3-b5ad-2011fd099a73/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-12-01 22:47:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 22:47:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-12-01 22:47:29,757 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-12-01 22:47:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:47:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:47:29,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:47:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 22:47:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 22:47:29,878 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:47:29,878 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-01 22:47:29,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:47:29 BoogieIcfgContainer [2018-12-01 22:47:29,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:47:29,879 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 22:47:29,879 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 22:47:29,881 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 22:47:29,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:47:29,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 10:47:29" (1/3) ... [2018-12-01 22:47:29,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2605b3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:47:29, skipping insertion in model container [2018-12-01 22:47:29,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:47:29,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:29" (2/3) ... [2018-12-01 22:47:29,883 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2605b3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:47:29, skipping insertion in model container [2018-12-01 22:47:29,883 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:47:29,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:47:29" (3/3) ... [2018-12-01 22:47:29,884 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B_true-termination.c.i [2018-12-01 22:47:29,916 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:47:29,916 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 22:47:29,916 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 22:47:29,916 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 22:47:29,916 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:47:29,916 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:47:29,916 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 22:47:29,917 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:47:29,917 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 22:47:29,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-01 22:47:29,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 22:47:29,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:47:29,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:47:29,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 22:47:29,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:29,947 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 22:47:29,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-01 22:47:29,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 22:47:29,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:47:29,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:47:29,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 22:47:29,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:29,953 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 19#L28-3true [2018-12-01 22:47:29,953 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 12#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 7#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 15#recFINALtrue assume true; 13#recEXITtrue >#39#return; 10#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 5#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 19#L28-3true [2018-12-01 22:47:29,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-12-01 22:47:29,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:29,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:29,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:30,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1673639481, now seen corresponding path program 1 times [2018-12-01 22:47:30,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:30,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:30,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:30,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:30,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash -508919995, now seen corresponding path program 1 times [2018-12-01 22:47:30,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:30,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:30,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:30,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:30,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:30,376 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-01 22:47:30,462 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:47:30,463 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:47:30,463 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:47:30,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:47:30,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:47:30,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:47:30,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:47:30,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:47:30,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration1_Lasso [2018-12-01 22:47:30,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:47:30,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:47:30,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:30,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:47:30,817 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:47:30,818 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-12-01 22:47:30,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:30,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:30,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:30,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:30,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:30,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:30,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:30,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:30,824 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-12-01 22:47:30,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:30,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:30,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:30,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:30,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:30,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:30,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:30,843 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-12-01 22:47:30,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:30,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:30,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:30,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:30,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:30,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:30,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:47:30,863 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:47:30,863 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 22:47:30,865 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:47:30,865 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 22:47:30,866 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:47:30,866 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-12-01 22:47:30,874 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 22:47:30,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 22:47:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:30,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:30,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:30,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:47:30,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:47:30,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-01 22:47:30,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 22:47:30,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-01 22:47:30,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-12-01 22:47:30,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 22:47:30,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:47:30,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:47:30,994 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2018-12-01 22:47:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:31,034 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 22:47:31,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 6 states. [2018-12-01 22:47:31,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 6 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2018-12-01 22:47:31,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-01 22:47:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:47:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-12-01 22:47:31,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 9 letters. [2018-12-01 22:47:31,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:31,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 11 letters. Loop has 9 letters. [2018-12-01 22:47:31,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:31,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 18 letters. [2018-12-01 22:47:31,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:31,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. [2018-12-01 22:47:31,117 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-01 22:47:31,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 58 transitions. [2018-12-01 22:47:31,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-01 22:47:31,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-01 22:47:31,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2018-12-01 22:47:31,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:47:31,122 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-12-01 22:47:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2018-12-01 22:47:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-01 22:47:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-01 22:47:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-12-01 22:47:31,141 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-01 22:47:31,141 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-01 22:47:31,141 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 22:47:31,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-12-01 22:47:31,142 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-01 22:47:31,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:47:31,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:47:31,142 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:31,142 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 22:47:31,143 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 193#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 208#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 188#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 200#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 187#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 175#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2018-12-01 22:47:31,143 INFO L796 eck$LassoCheckResult]: Loop: 173#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 176#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 174#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2018-12-01 22:47:31,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -15731550, now seen corresponding path program 1 times [2018-12-01 22:47:31,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:31,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:31,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:31,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:31,170 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 1 times [2018-12-01 22:47:31,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:31,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:31,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:31,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash -507170626, now seen corresponding path program 2 times [2018-12-01 22:47:31,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:31,626 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-01 22:47:31,899 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-12-01 22:47:31,967 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:47:31,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:47:31,967 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:47:31,967 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:47:31,967 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:47:31,967 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:47:31,967 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:47:31,967 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:47:31,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration2_Lasso [2018-12-01 22:47:31,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:47:31,967 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:47:31,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:31,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:32,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:47:32,245 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:47:32,245 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-12-01 22:47:32,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,247 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-12-01 22:47:32,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,248 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-12-01 22:47:32,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,249 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-12-01 22:47:32,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,250 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-12-01 22:47:32,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,252 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-12-01 22:47:32,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,253 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-12-01 22:47:32,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,254 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-12-01 22:47:32,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:32,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,256 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-12-01 22:47:32,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,258 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-12-01 22:47:32,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:32,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:32,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:32,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,259 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-12-01 22:47:32,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:32,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,264 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-12-01 22:47:32,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:32,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,267 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-12-01 22:47:32,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,267 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:47:32,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,268 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 22:47:32,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,269 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-12-01 22:47:32,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:32,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,272 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-12-01 22:47:32,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,272 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:47:32,272 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 22:47:32,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,273 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-01 22:47:32,274 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 22:47:32,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,279 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-12-01 22:47:32,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:32,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,283 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-12-01 22:47:32,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:32,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:32,289 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-12-01 22:47:32,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:32,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:32,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:32,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:32,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:32,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:32,298 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:47:32,302 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:47:32,302 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 22:47:32,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:47:32,303 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 22:47:32,303 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:47:32,303 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-12-01 22:47:32,307 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-01 22:47:32,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 22:47:32,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:32,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:32,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:32,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-01 22:47:32,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-01 22:47:32,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:47:32,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:47:32,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-01 22:47:32,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 22:47:32,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:47:32,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 22:47:32,436 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-01 22:47:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:32,457 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-12-01 22:47:32,457 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-01 22:47:32,516 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 128 states and 165 transitions. Complement of second has 17 states. [2018-12-01 22:47:32,517 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-12-01 22:47:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 22:47:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-01 22:47:32,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-01 22:47:32,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:32,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-01 22:47:32,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:32,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-01 22:47:32,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:32,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2018-12-01 22:47:32,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 22:47:32,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 110 states and 147 transitions. [2018-12-01 22:47:32,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-12-01 22:47:32,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-12-01 22:47:32,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 147 transitions. [2018-12-01 22:47:32,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:47:32,529 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 147 transitions. [2018-12-01 22:47:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 147 transitions. [2018-12-01 22:47:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2018-12-01 22:47:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-01 22:47:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2018-12-01 22:47:32,538 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2018-12-01 22:47:32,538 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2018-12-01 22:47:32,538 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 22:47:32,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2018-12-01 22:47:32,540 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 22:47:32,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:47:32,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:47:32,540 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:32,540 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:32,540 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 442#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 443#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 470#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 494#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 504#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 516#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 515#recFINAL assume true; 493#recEXIT >#39#return; 453#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 438#L33-3 [2018-12-01 22:47:32,540 INFO L796 eck$LassoCheckResult]: Loop: 438#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 439#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 485#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 476#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 497#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 489#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 490#recFINAL assume true; 475#recEXIT >#39#return; 472#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 438#L33-3 [2018-12-01 22:47:32,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2061793209, now seen corresponding path program 1 times [2018-12-01 22:47:32,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:32,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:32,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:47:32,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:32,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:32,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:47:32,592 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 22:47:32,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 2 times [2018-12-01 22:47:32,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:32,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:32,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:32,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:32,852 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-12-01 22:47:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:47:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:47:32,901 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 41 Second operand 5 states. [2018-12-01 22:47:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:32,924 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2018-12-01 22:47:32,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:47:32,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2018-12-01 22:47:32,926 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-01 22:47:32,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 117 transitions. [2018-12-01 22:47:32,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-12-01 22:47:32,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-12-01 22:47:32,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2018-12-01 22:47:32,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:47:32,928 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2018-12-01 22:47:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2018-12-01 22:47:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-01 22:47:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-01 22:47:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-12-01 22:47:32,932 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-12-01 22:47:32,932 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-12-01 22:47:32,932 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 22:47:32,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 115 transitions. [2018-12-01 22:47:32,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-01 22:47:32,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:47:32,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:47:32,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:32,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:32,935 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 651#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 652#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 678#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 637#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 636#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 638#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 653#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 700#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 706#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 675#recFINAL assume true; 676#recEXIT >#37#return; 697#L19-1 #res := #t~ret5;havoc #t~ret5; 695#recFINAL assume true; 694#recEXIT >#39#return; 661#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 647#L33-3 [2018-12-01 22:47:32,935 INFO L796 eck$LassoCheckResult]: Loop: 647#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 648#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 691#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 686#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 689#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 692#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 693#recFINAL assume true; 696#recEXIT >#39#return; 680#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 647#L33-3 [2018-12-01 22:47:32,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash 970657719, now seen corresponding path program 1 times [2018-12-01 22:47:32,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:32,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:47:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-01 22:47:32,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:32,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:47:32,970 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 22:47:32,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 3 times [2018-12-01 22:47:32,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:32,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:32,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:32,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:33,150 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2018-12-01 22:47:33,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:47:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:47:33,177 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. cyclomatic complexity: 33 Second operand 6 states. [2018-12-01 22:47:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:33,202 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2018-12-01 22:47:33,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:47:33,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2018-12-01 22:47:33,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 22:47:33,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 52 states and 63 transitions. [2018-12-01 22:47:33,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 22:47:33,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 22:47:33,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2018-12-01 22:47:33,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:47:33,205 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-12-01 22:47:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2018-12-01 22:47:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-12-01 22:47:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-01 22:47:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-12-01 22:47:33,207 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-12-01 22:47:33,207 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-12-01 22:47:33,207 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 22:47:33,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2018-12-01 22:47:33,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 22:47:33,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:47:33,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:47:33,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:33,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 22:47:33,208 INFO L794 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 825#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 826#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 820#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 821#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 845#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 852#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 834#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 854#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 858#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 856#recFINAL assume true; 837#recEXIT >#37#return; 838#L19-1 #res := #t~ret5;havoc #t~ret5; 850#recFINAL assume true; 846#recEXIT >#39#return; 830#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 822#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 823#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 819#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 814#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 811#recENTRY [2018-12-01 22:47:33,208 INFO L796 eck$LassoCheckResult]: Loop: 811#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 813#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 812#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 811#recENTRY [2018-12-01 22:47:33,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1312873862, now seen corresponding path program 1 times [2018-12-01 22:47:33,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:33,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:33,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:47:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:33,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 2 times [2018-12-01 22:47:33,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:33,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:33,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1853025306, now seen corresponding path program 2 times [2018-12-01 22:47:33,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:33,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:33,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:47:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:47:33,582 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-01 22:47:34,525 WARN L180 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 178 [2018-12-01 22:47:34,713 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-12-01 22:47:35,026 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-12-01 22:47:35,148 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-01 22:47:35,150 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:47:35,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:47:35,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:47:35,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:47:35,151 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:47:35,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:47:35,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:47:35,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:47:35,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration5_Lasso [2018-12-01 22:47:35,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:47:35,151 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:47:35,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:47:35,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:47:35,474 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:47:35,474 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-12-01 22:47:35,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,476 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-12-01 22:47:35,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,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-12-01 22:47:35,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,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-12-01 22:47:35,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,486 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-12-01 22:47:35,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,489 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-12-01 22:47:35,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,491 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-12-01 22:47:35,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,493 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-12-01 22:47:35,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:47:35,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:47:35,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:47:35,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,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-12-01 22:47:35,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,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-12-01 22:47:35,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,510 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:47:35,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,510 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 22:47:35,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,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-12-01 22:47:35,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,512 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:47:35,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,513 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 22:47:35,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,515 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-12-01 22:47:35,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:47:35,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,516 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 22:47:35,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,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-12-01 22:47:35,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,518 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:47:35,518 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 22:47:35,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,520 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-01 22:47:35,520 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 22:47:35,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:47:35,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:47:35,532 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-12-01 22:47:35,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:47:35,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:47:35,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:47:35,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:47:35,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:47:35,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:47:35,537 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:47:35,540 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:47:35,540 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 22:47:35,540 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:47:35,541 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 22:47:35,541 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:47:35,541 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-12-01 22:47:35,544 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-01 22:47:35,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 22:47:35,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:35,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:35,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:35,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-01 22:47:35,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-01 22:47:35,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:47:35,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:47:35,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-01 22:47:35,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 22:47:35,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:47:35,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 22:47:35,665 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-01 22:47:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:35,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 22:47:35,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-01 22:47:35,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2018-12-01 22:47:35,730 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-12-01 22:47:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 22:47:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-01 22:47:35,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-01 22:47:35,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:35,731 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 22:47:35,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:35,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:35,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:35,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-01 22:47:35,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-01 22:47:35,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:47:35,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:47:35,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-01 22:47:35,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 22:47:35,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:47:35,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 22:47:35,857 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-01 22:47:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:35,872 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 22:47:35,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-01 22:47:35,910 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2018-12-01 22:47:35,911 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-12-01 22:47:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 22:47:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-01 22:47:35,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-01 22:47:35,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:35,911 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 22:47:35,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:35,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:35,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:47:35,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-01 22:47:35,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-01 22:47:35,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:47:36,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:47:36,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-01 22:47:36,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-01 22:47:36,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:47:36,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 22:47:36,041 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-01 22:47:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:36,057 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 22:47:36,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-01 22:47:36,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 76 states and 88 transitions. Complement of second has 17 states. [2018-12-01 22:47:36,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 22:47:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-01 22:47:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-01 22:47:36,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-01 22:47:36,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:36,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 23 letters. Loop has 3 letters. [2018-12-01 22:47:36,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:36,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-01 22:47:36,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:47:36,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 88 transitions. [2018-12-01 22:47:36,122 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 22:47:36,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2018-12-01 22:47:36,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 22:47:36,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 22:47:36,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 22:47:36,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 22:47:36,123 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:47:36,123 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:47:36,123 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:47:36,123 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 22:47:36,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 22:47:36,123 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 22:47:36,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 22:47:36,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 10:47:36 BoogieIcfgContainer [2018-12-01 22:47:36,127 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 22:47:36,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:47:36,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:47:36,127 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:47:36,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:47:29" (3/4) ... [2018-12-01 22:47:36,130 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:47:36,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:47:36,130 INFO L168 Benchmark]: Toolchain (without parser) took 6613.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 194.2 MB. Max. memory is 11.5 GB. [2018-12-01 22:47:36,131 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:47:36,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:47:36,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.67 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:47:36,131 INFO L168 Benchmark]: Boogie Preprocessor took 42.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:47:36,132 INFO L168 Benchmark]: RCFGBuilder took 155.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-12-01 22:47:36,132 INFO L168 Benchmark]: BuchiAutomizer took 6248.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 218.6 MB. Max. memory is 11.5 GB. [2018-12-01 22:47:36,132 INFO L168 Benchmark]: Witness Printer took 2.71 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-12-01 22:47:36,134 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.67 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 155.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6248.38 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 218.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.71 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 104 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 59 SDslu, 116 SDs, 0 SdLazy, 173 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital350 mio100 ax100 hnf100 lsp97 ukn42 mio100 lsp29 div100 bol100 ite100 ukn100 eq186 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...