./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 205669a0469477740fa35099dd0e4ee1e635b686 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:06:02,483 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:06:02,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:06:02,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:06:02,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:06:02,498 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:06:02,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:06:02,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:06:02,504 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:06:02,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:06:02,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:06:02,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:06:02,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:06:02,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:06:02,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:06:02,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:06:02,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:06:02,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:06:02,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:06:02,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:06:02,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:06:02,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:06:02,525 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:06:02,525 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:06:02,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:06:02,526 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:06:02,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:06:02,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:06:02,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:06:02,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:06:02,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:06:02,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:06:02,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:06:02,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:06:02,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:06:02,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:06:02,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:06:02,554 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:06:02,554 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:06:02,556 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:06:02,556 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:06:02,556 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:06:02,556 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:06:02,557 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:06:02,557 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:06:02,557 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:06:02,557 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:06:02,557 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:06:02,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:06:02,558 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:06:02,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:06:02,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:06:02,558 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:06:02,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:06:02,560 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:06:02,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:06:02,560 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:06:02,561 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:06:02,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:06:02,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:06:02,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:06:02,562 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:06:02,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:06:02,562 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:06:02,562 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:06:02,563 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:06:02,563 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 205669a0469477740fa35099dd0e4ee1e635b686 [2019-01-01 22:06:02,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:06:02,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:06:02,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:06:02,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:06:02,631 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:06:02,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2019-01-01 22:06:02,692 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f33cca10/fc9cbfe505a1424b8660b412a7f3749c/FLAG699d359cc [2019-01-01 22:06:03,106 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:06:03,107 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2019-01-01 22:06:03,113 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f33cca10/fc9cbfe505a1424b8660b412a7f3749c/FLAG699d359cc [2019-01-01 22:06:03,479 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f33cca10/fc9cbfe505a1424b8660b412a7f3749c [2019-01-01 22:06:03,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:06:03,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:06:03,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:03,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:06:03,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:06:03,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ff8dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03, skipping insertion in model container [2019-01-01 22:06:03,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:06:03,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:06:03,710 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:03,725 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:06:03,748 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:03,768 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:06:03,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03 WrapperNode [2019-01-01 22:06:03,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:03,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:03,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:06:03,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:06:03,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:03,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:06:03,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:06:03,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:06:03,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... [2019-01-01 22:06:03,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:06:03,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:06:03,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:06:03,875 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:06:03,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 22:06:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:06:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-01-01 22:06:04,013 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-01-01 22:06:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:06:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:06:04,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:06:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:06:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:06:04,418 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:06:04,419 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:06:04,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:04 BoogieIcfgContainer [2019-01-01 22:06:04,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:06:04,420 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:06:04,421 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:06:04,424 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:06:04,425 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:04,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:06:03" (1/3) ... [2019-01-01 22:06:04,426 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35e5f6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:04, skipping insertion in model container [2019-01-01 22:06:04,427 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:04,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:03" (2/3) ... [2019-01-01 22:06:04,427 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35e5f6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:04, skipping insertion in model container [2019-01-01 22:06:04,427 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:04,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:04" (3/3) ... [2019-01-01 22:06:04,429 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2_true-termination.c.i [2019-01-01 22:06:04,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:06:04,494 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:06:04,494 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:06:04,494 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:06:04,494 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:06:04,495 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:06:04,495 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:06:04,495 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:06:04,495 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:06:04,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:06:04,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:04,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:04,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:04,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:06:04,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:04,552 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:06:04,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:06:04,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:04,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:04,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:04,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:06:04,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:04,563 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 7#L23-3true [2019-01-01 22:06:04,564 INFO L796 eck$LassoCheckResult]: Loop: 7#L23-3true call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 12#L23-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 3#L26true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 17#L26-1true call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 7#L23-3true [2019-01-01 22:06:04,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-01-01 22:06:04,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:04,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2019-01-01 22:06:04,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:04,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:04,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:05,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:06:05,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 22:06:05,032 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:06:05,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:06:05,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:06:05,054 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-01-01 22:06:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:05,337 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-01-01 22:06:05,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:06:05,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-01-01 22:06:05,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:05,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2019-01-01 22:06:05,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 22:06:05,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 22:06:05,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-01-01 22:06:05,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:05,369 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 22:06:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-01-01 22:06:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 22:06:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 22:06:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-01 22:06:05,401 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 22:06:05,401 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-01 22:06:05,401 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:06:05,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-01-01 22:06:05,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:05,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:05,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:05,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:06:05,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:05,405 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 49#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 50#L23-3 [2019-01-01 22:06:05,405 INFO L796 eck$LassoCheckResult]: Loop: 50#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 53#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 46#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 51#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 45#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 47#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 51#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 45#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 48#recFINAL assume true; 54#recEXIT >#29#return; 55#L17-1 #res := #t~ret6;havoc #t~ret6; 56#recFINAL assume true; 58#recEXIT >#31#return; 57#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 50#L23-3 [2019-01-01 22:06:05,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:05,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-01-01 22:06:05,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:05,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2019-01-01 22:06:05,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:05,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:06:05,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:05,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:06:05,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:05,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:06,014 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 23 treesize of output 33 [2019-01-01 22:06:06,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2019-01-01 22:06:06,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:06,147 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 20 treesize of output 19 [2019-01-01 22:06:06,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:06,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:06,179 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 1 xjuncts. [2019-01-01 22:06:06,180 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-01-01 22:06:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:06:06,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:06,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-01-01 22:06:06,716 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:06:06,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 22:06:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-01 22:06:06,717 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 14 states. [2019-01-01 22:06:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:07,284 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-01-01 22:06:07,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:06:07,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-01-01 22:06:07,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:07,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-01-01 22:06:07,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 22:06:07,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 22:06:07,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-01-01 22:06:07,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:07,291 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 22:06:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-01-01 22:06:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 22:06:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 22:06:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-01 22:06:07,295 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 22:06:07,295 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 22:06:07,295 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:06:07,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-01-01 22:06:07,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:07,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:07,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:07,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:06:07,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:07,298 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 137#L23-3 [2019-01-01 22:06:07,298 INFO L796 eck$LassoCheckResult]: Loop: 137#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 144#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 140#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 139#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 139#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 141#recFINAL assume true; 145#recEXIT >#29#return; 146#L17-1 #res := #t~ret6;havoc #t~ret6; 147#recFINAL assume true; 152#recEXIT >#29#return; 150#L17-1 #res := #t~ret6;havoc #t~ret6; 151#recFINAL assume true; 149#recEXIT >#31#return; 148#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 137#L23-3 [2019-01-01 22:06:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:07,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-01-01 22:06:07,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:07,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:07,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:07,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2019-01-01 22:06:07,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:07,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:07,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:07,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 22:06:07,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:07,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:06:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:06:07,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:06:07,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:06:07,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:07,823 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 23 treesize of output 33 [2019-01-01 22:06:07,832 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 24 treesize of output 23 [2019-01-01 22:06:07,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,888 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 1 xjuncts. [2019-01-01 22:06:07,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-01-01 22:06:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 22:06:08,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:08,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-01-01 22:06:08,189 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:06:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 22:06:08,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-01-01 22:06:08,190 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 17 states. [2019-01-01 22:06:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:08,458 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-01-01 22:06:08,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 22:06:08,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-01-01 22:06:08,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:08,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-01-01 22:06:08,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 22:06:08,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 22:06:08,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-01-01 22:06:08,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:08,462 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 22:06:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-01-01 22:06:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 22:06:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 22:06:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-01 22:06:08,466 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 22:06:08,466 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-01 22:06:08,466 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:06:08,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-01-01 22:06:08,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 22:06:08,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:08,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:08,469 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:06:08,469 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:08,469 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 255#L23-3 [2019-01-01 22:06:08,470 INFO L796 eck$LassoCheckResult]: Loop: 255#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 262#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 258#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 259#recFINAL assume true; 273#recEXIT >#29#return; 266#L17-1 #res := #t~ret6;havoc #t~ret6; 265#recFINAL assume true; 263#recEXIT >#29#return; 264#L17-1 #res := #t~ret6;havoc #t~ret6; 272#recFINAL assume true; 271#recEXIT >#29#return; 269#L17-1 #res := #t~ret6;havoc #t~ret6; 270#recFINAL assume true; 268#recEXIT >#31#return; 267#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 255#L23-3 [2019-01-01 22:06:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2019-01-01 22:06:08,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:08,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:08,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:08,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:08,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2019-01-01 22:06:08,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:08,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:08,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:08,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2019-01-01 22:06:08,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:08,913 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 22:06:09,502 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-01-01 22:06:09,784 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 22:06:09,984 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-01 22:06:10,517 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-01-01 22:06:10,821 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 22:06:10,954 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-01 22:06:11,138 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 22:06:11,586 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-01-01 22:06:11,708 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 22:06:11,868 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-01 22:06:12,049 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-01 22:06:12,687 WARN L181 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-01-01 22:06:12,855 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-01 22:06:12,969 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:12,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:12,971 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:12,971 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:12,971 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:12,971 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:12,971 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:12,971 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:12,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration4_Lasso [2019-01-01 22:06:12,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:12,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:12,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:12,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:12,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:13,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:13,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:13,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:13,455 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-01-01 22:06:13,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:13,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:13,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:13,740 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 22:06:14,790 WARN L181 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-01 22:06:14,905 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:14,911 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:14,914 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 [2019-01-01 22:06:14,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,922 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 [2019-01-01 22:06:14,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,925 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 [2019-01-01 22:06:14,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,927 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 [2019-01-01 22:06:14,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,930 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 [2019-01-01 22:06:14,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:14,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:14,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:14,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,970 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 [2019-01-01 22:06:14,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,970 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:06:14,971 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2019-01-01 22:06:14,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:15,209 INFO L402 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2019-01-01 22:06:15,210 INFO L403 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2019-01-01 22:06:16,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,658 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 [2019-01-01 22:06:16,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:16,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:16,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:16,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:16,661 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 [2019-01-01 22:06:16,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:16,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:16,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:16,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:16,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:16,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:16,680 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:16,695 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:06:16,695 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:06:16,698 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:16,699 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:16,700 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:16,700 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1 Supporting invariants [] [2019-01-01 22:06:16,778 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:06:16,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:17,489 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:06:17,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:17,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:17,554 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 [2019-01-01 22:06:17,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:17,683 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 [2019-01-01 22:06:17,698 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 [2019-01-01 22:06:17,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:17,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:17,868 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. [2019-01-01 22:06:17,869 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-01-01 22:06:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-01 22:06:19,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-01-01 22:06:19,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-01-01 22:06:19,321 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 66 states and 73 transitions. Complement of second has 24 states. [2019-01-01 22:06:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-01-01 22:06:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 22:06:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-01 22:06:19,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 26 letters. [2019-01-01 22:06:19,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:19,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 28 letters. Loop has 26 letters. [2019-01-01 22:06:19,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:19,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 52 letters. [2019-01-01 22:06:19,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:19,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2019-01-01 22:06:19,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:19,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 35 states and 40 transitions. [2019-01-01 22:06:19,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:06:19,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:06:19,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-01-01 22:06:19,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:19,334 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-01 22:06:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-01-01 22:06:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-01 22:06:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 22:06:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-01 22:06:19,338 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-01 22:06:19,338 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-01 22:06:19,338 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:06:19,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-01-01 22:06:19,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:19,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:19,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:19,340 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:06:19,340 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:19,340 INFO L794 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 489#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 490#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 503#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 492#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 498#recENTRY [2019-01-01 22:06:19,340 INFO L796 eck$LassoCheckResult]: Loop: 498#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 491#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 493#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 498#recENTRY [2019-01-01 22:06:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash 36330294, now seen corresponding path program 1 times [2019-01-01 22:06:19,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:19,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:19,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:19,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:19,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:19,357 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 1 times [2019-01-01 22:06:19,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:19,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:19,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:19,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash -15969886, now seen corresponding path program 1 times [2019-01-01 22:06:19,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:19,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:19,817 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-01 22:06:19,974 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-01 22:06:20,391 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-01-01 22:06:20,499 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-01 22:06:20,629 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 22:06:21,008 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 22:06:21,012 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:21,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:21,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:21,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:21,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:21,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:21,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:21,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:21,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration5_Lasso [2019-01-01 22:06:21,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:21,013 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:21,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,196 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-01 22:06:21,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:21,857 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:21,858 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 [2019-01-01 22:06:21,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,861 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 [2019-01-01 22:06:21,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:21,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,865 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 [2019-01-01 22:06:21,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,866 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 [2019-01-01 22:06:21,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,869 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 [2019-01-01 22:06:21,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:21,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:21,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,872 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 [2019-01-01 22:06:21,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,874 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 [2019-01-01 22:06:21,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,876 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 [2019-01-01 22:06:21,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,878 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 [2019-01-01 22:06:21,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,880 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 [2019-01-01 22:06:21,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:21,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:21,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:21,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:21,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,884 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 [2019-01-01 22:06:21,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:21,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:21,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:21,892 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 [2019-01-01 22:06:21,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:21,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:21,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:21,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:21,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:21,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:21,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:21,907 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:06:21,907 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:06:21,907 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:21,908 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:21,908 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:21,908 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2019-01-01 22:06:21,979 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:06:21,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:22,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:22,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:22,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:22,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:06:22,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:22,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:06:22,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:22,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:22,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:22,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:06:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:22,892 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 [2019-01-01 22:06:22,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 22:06:23,486 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 14 states. [2019-01-01 22:06:23,487 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 [2019-01-01 22:06:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:06:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 22:06:23,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 22:06:23,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:23,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 22:06:23,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:23,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 22:06:23,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:23,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-01-01 22:06:23,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:23,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2019-01-01 22:06:23,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 22:06:23,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 22:06:23,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2019-01-01 22:06:23,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:23,497 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-01-01 22:06:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2019-01-01 22:06:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 22:06:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:06:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-01-01 22:06:23,670 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-01-01 22:06:23,670 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-01-01 22:06:23,670 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:06:23,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2019-01-01 22:06:23,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:23,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:23,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:23,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 22:06:23,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:23,674 INFO L794 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 653#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 669#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 671#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 685#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 684#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 664#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 682#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 681#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 665#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 682#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 681#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 665#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 682#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 678#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 679#recFINAL assume true; 683#recEXIT >#29#return; 661#L17-1 #res := #t~ret6;havoc #t~ret6; 666#recFINAL assume true; 677#recEXIT >#29#return; 675#L17-1 #res := #t~ret6;havoc #t~ret6; 676#recFINAL assume true; 674#recEXIT >#29#return; 673#L17-1 #res := #t~ret6;havoc #t~ret6; 672#recFINAL assume true; 670#recEXIT >#31#return; 667#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 668#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 657#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 647#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 654#recENTRY [2019-01-01 22:06:23,674 INFO L796 eck$LassoCheckResult]: Loop: 654#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 646#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 648#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 654#recENTRY [2019-01-01 22:06:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 770731142, now seen corresponding path program 2 times [2019-01-01 22:06:23,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:23,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:23,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:24,086 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-01 22:06:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 22:06:24,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:24,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:06:24,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:06:24,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:06:24,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:06:24,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:24,498 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 6 treesize of output 5 [2019-01-01 22:06:24,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:24,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 22:06:24,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:06:24,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:24,526 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:24,532 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. [2019-01-01 22:06:24,533 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2019-01-01 22:06:24,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:24,573 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 [2019-01-01 22:06:24,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:24,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-01 22:06:24,596 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 12 treesize of output 11 [2019-01-01 22:06:24,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:24,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:24,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:24,621 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2019-01-01 22:06:25,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:25,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-01-01 22:06:25,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:25,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-01-01 22:06:25,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:25,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:25,321 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 1 xjuncts. [2019-01-01 22:06:25,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:41 [2019-01-01 22:06:25,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:25,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-01 22:06:25,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-01-01 22:06:25,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:25,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:25,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 22:06:25,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:29 [2019-01-01 22:06:25,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-01-01 22:06:25,442 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 17 treesize of output 13 [2019-01-01 22:06:25,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:25,451 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 17 treesize of output 13 [2019-01-01 22:06:25,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:06:25,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:06:25,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 22:06:25,462 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:13 [2019-01-01 22:06:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:06:25,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:25,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2019-01-01 22:06:25,506 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 2 times [2019-01-01 22:06:25,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:25,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:25,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:25,993 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-01 22:06:26,398 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 22:06:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-01 22:06:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2019-01-01 22:06:26,400 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 31 states. [2019-01-01 22:06:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:27,499 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-01-01 22:06:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 22:06:27,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-01-01 22:06:27,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:27,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2019-01-01 22:06:27,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 22:06:27,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 22:06:27,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-01-01 22:06:27,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:27,508 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-01 22:06:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-01-01 22:06:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-01-01 22:06:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 22:06:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-01-01 22:06:27,515 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-01 22:06:27,515 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-01 22:06:27,515 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:06:27,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-01-01 22:06:27,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:27,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:27,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:27,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 22:06:27,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:27,518 INFO L794 eck$LassoCheckResult]: Stem: 891#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 882#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 883#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 893#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 885#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 886#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 908#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 880#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 910#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 879#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 910#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 879#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 910#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 879#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 912#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 878#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 881#recFINAL assume true; 896#recEXIT >#29#return; 897#L17-1 #res := #t~ret6;havoc #t~ret6; 898#recFINAL assume true; 894#recEXIT >#29#return; 895#L17-1 #res := #t~ret6;havoc #t~ret6; 913#recFINAL assume true; 911#recEXIT >#29#return; 907#L17-1 #res := #t~ret6;havoc #t~ret6; 909#recFINAL assume true; 906#recEXIT >#29#return; 905#L17-1 #res := #t~ret6;havoc #t~ret6; 904#recFINAL assume true; 902#recEXIT >#31#return; 899#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 900#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 892#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 877#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 884#recENTRY [2019-01-01 22:06:27,518 INFO L796 eck$LassoCheckResult]: Loop: 884#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 875#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 876#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 884#recENTRY [2019-01-01 22:06:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1655830132, now seen corresponding path program 3 times [2019-01-01 22:06:27,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:27,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:27,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:27,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:27,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:27,597 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 3 times [2019-01-01 22:06:27,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:27,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1136068004, now seen corresponding path program 4 times [2019-01-01 22:06:27,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:27,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:28,035 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-01 22:06:28,740 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-01-01 22:06:29,351 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-01-01 22:06:29,550 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-01 22:06:29,668 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 22:06:30,261 WARN L181 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-01-01 22:06:30,382 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 22:06:30,521 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-01 22:06:30,772 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-01 22:06:31,421 WARN L181 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-01-01 22:06:31,565 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 22:06:31,722 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-01-01 22:06:31,919 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-01-01 22:06:33,933 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 242 DAG size of output: 209 [2019-01-01 22:06:34,560 WARN L181 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-01-01 22:06:35,034 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-01 22:06:35,600 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-01 22:06:35,607 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:35,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:35,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:35,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:35,608 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:35,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:35,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:35,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:35,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration7_Lasso [2019-01-01 22:06:35,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:35,609 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:35,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:36,201 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-01-01 22:06:36,387 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-01 22:06:36,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:36,671 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 22:06:46,519 WARN L181 SmtUtils]: Spent 9.75 s on a formula simplification. DAG size of input: 173 DAG size of output: 173 [2019-01-01 22:06:46,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:46,710 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:46,710 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 [2019-01-01 22:06:46,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,717 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 [2019-01-01 22:06:46,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,719 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 [2019-01-01 22:06:46,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,721 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 [2019-01-01 22:06:46,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,723 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 [2019-01-01 22:06:46,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:46,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:46,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,726 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 [2019-01-01 22:06:46,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,728 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 [2019-01-01 22:06:46,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,729 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 [2019-01-01 22:06:46,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,731 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 [2019-01-01 22:06:46,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,733 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 [2019-01-01 22:06:46,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,735 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 [2019-01-01 22:06:46,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,737 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 [2019-01-01 22:06:46,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:46,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:46,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,740 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 [2019-01-01 22:06:46,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,742 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 [2019-01-01 22:06:46,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,744 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 [2019-01-01 22:06:46,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,746 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 [2019-01-01 22:06:46,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,748 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 [2019-01-01 22:06:46,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,750 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 [2019-01-01 22:06:46,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,752 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 [2019-01-01 22:06:46,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,754 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 [2019-01-01 22:06:46,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,756 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 [2019-01-01 22:06:46,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,758 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 [2019-01-01 22:06:46,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,760 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 [2019-01-01 22:06:46,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,762 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 [2019-01-01 22:06:46,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,764 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 [2019-01-01 22:06:46,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,766 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 [2019-01-01 22:06:46,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,768 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 [2019-01-01 22:06:46,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,770 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 [2019-01-01 22:06:46,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,772 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 [2019-01-01 22:06:46,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,774 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 [2019-01-01 22:06:46,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,776 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 [2019-01-01 22:06:46,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,778 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 [2019-01-01 22:06:46,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,780 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 [2019-01-01 22:06:46,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:46,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:46,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:46,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,781 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 [2019-01-01 22:06:46,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:46,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:46,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:46,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:46,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:46,785 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 [2019-01-01 22:06:46,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:46,786 INFO L205 nArgumentSynthesizer]: 128 stem disjuncts [2019-01-01 22:06:46,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:06:46,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:46,841 INFO L402 nArgumentSynthesizer]: We have 524 Motzkin's Theorem applications. [2019-01-01 22:06:46,841 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 22:06:47,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:47,298 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 [2019-01-01 22:06:47,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:47,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:47,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:47,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:47,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:47,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:47,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:47,305 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 [2019-01-01 22:06:47,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:47,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:47,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:47,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:47,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:47,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:47,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:47,352 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:06:47,352 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 22:06:47,352 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:47,353 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:47,353 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:47,353 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2019-01-01 22:06:47,484 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-01 22:06:47,498 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:47,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:47,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:48,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:48,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:06:48,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:48,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:06:48,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:06:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:48,073 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 [2019-01-01 22:06:48,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 22:06:48,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2019-01-01 22:06:48,204 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 [2019-01-01 22:06:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 22:06:48,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-01-01 22:06:48,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:48,205 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:06:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:48,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:48,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:48,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:48,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:06:48,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:48,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:06:48,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:06:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:48,410 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 [2019-01-01 22:06:48,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 22:06:48,487 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 14 states. [2019-01-01 22:06:48,489 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 [2019-01-01 22:06:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 22:06:48,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-01-01 22:06:48,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:48,490 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:06:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:48,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:48,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:48,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:48,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:06:48,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:48,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:06:48,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:48,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:06:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:48,709 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 [2019-01-01 22:06:48,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 22:06:48,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2019-01-01 22:06:48,827 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 [2019-01-01 22:06:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-01-01 22:06:48,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 3 letters. [2019-01-01 22:06:48,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:48,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 40 letters. Loop has 3 letters. [2019-01-01 22:06:48,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:48,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 37 letters. Loop has 6 letters. [2019-01-01 22:06:48,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:48,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2019-01-01 22:06:48,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:48,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2019-01-01 22:06:48,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:06:48,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:06:48,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:06:48,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:48,833 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:48,834 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:48,834 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:48,834 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:06:48,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:06:48,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:48,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:06:48,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:06:48 BoogieIcfgContainer [2019-01-01 22:06:48,844 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:06:48,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:06:48,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:06:48,845 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:06:48,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:04" (3/4) ... [2019-01-01 22:06:48,849 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:06:48,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:06:48,850 INFO L168 Benchmark]: Toolchain (without parser) took 45366.84 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 856.7 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -242.2 MB). Peak memory consumption was 614.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:48,851 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:48,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.87 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:48,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.04 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:48,853 INFO L168 Benchmark]: Boogie Preprocessor took 42.10 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:48,854 INFO L168 Benchmark]: RCFGBuilder took 550.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:48,854 INFO L168 Benchmark]: BuchiAutomizer took 44424.04 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 712.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.0 MB). Peak memory consumption was 644.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:48,855 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 1.9 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:48,861 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.87 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.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 55.04 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.10 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 550.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 44424.04 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 712.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.0 MB). Peak memory consumption was 644.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 ms. Allocated memory is still 1.9 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[ip][ip] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 44.3s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 36.3s. Construction of modules took 1.9s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/30 HoareTripleCheckerStatistics: 82 SDtfs, 59 SDslu, 242 SDs, 0 SdLazy, 717 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp29 div100 bol100 ite100 ukn100 eq181 hnf91 smp100 dnf2287 smp86 tf100 neg86 sie150 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 1687ms VariablesStem: 3 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 608 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...