./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 2e43c76eef4a87266f6a401a44aa5422f52ed742 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:22:08,471 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:22:08,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:22:08,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:22:08,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:22:08,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:22:08,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:22:08,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:22:08,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:22:08,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:22:08,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:22:08,512 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:22:08,513 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:22:08,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:22:08,516 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:22:08,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:22:08,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:22:08,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:22:08,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:22:08,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:22:08,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:22:08,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:22:08,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:22:08,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:22:08,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:22:08,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:22:08,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:22:08,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:22:08,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:22:08,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:22:08,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:22:08,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:22:08,536 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:22:08,536 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:22:08,538 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:22:08,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:22:08,539 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:22:08,556 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:22:08,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:22:08,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:22:08,558 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:22:08,558 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:22:08,558 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:22:08,558 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:22:08,559 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:22:08,559 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:22:08,559 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:22:08,559 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:22:08,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:22:08,559 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:22:08,561 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:22:08,561 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:22:08,561 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:22:08,561 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:22:08,561 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:22:08,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:22:08,562 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:22:08,562 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:22:08,562 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:22:08,562 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:22:08,562 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:22:08,562 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:22:08,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:22:08,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:22:08,564 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:22:08,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:22:08,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:22:08,565 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:22:08,566 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:22:08,566 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e43c76eef4a87266f6a401a44aa5422f52ed742 [2019-01-02 00:22:08,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:22:08,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:22:08,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:22:08,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:22:08,624 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:22:08,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2019-01-02 00:22:08,689 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2697bb9a6/9d48cd8911804479b3ef008793c62dec/FLAGf800017d3 [2019-01-02 00:22:09,262 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:22:09,262 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2019-01-02 00:22:09,277 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2697bb9a6/9d48cd8911804479b3ef008793c62dec/FLAGf800017d3 [2019-01-02 00:22:09,534 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2697bb9a6/9d48cd8911804479b3ef008793c62dec [2019-01-02 00:22:09,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:22:09,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:22:09,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:22:09,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:22:09,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:22:09,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:22:09" (1/1) ... [2019-01-02 00:22:09,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab228e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:09, skipping insertion in model container [2019-01-02 00:22:09,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:22:09" (1/1) ... [2019-01-02 00:22:09,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:22:09,626 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:22:10,164 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:22:10,191 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:22:10,333 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:22:10,432 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:22:10,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10 WrapperNode [2019-01-02 00:22:10,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:22:10,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:22:10,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:22:10,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:22:10,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:22:10,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:22:10,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:22:10,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:22:10,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (1/1) ... [2019-01-02 00:22:10,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:22:10,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:22:10,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:22:10,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:22:10,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (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-02 00:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-02 00:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-02 00:22:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-02 00:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-02 00:22:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:22:10,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:22:11,086 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:22:11,086 INFO L280 CfgBuilder]: Removed 20 assue(true) statements. [2019-01-02 00:22:11,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:22:11 BoogieIcfgContainer [2019-01-02 00:22:11,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:22:11,088 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:22:11,088 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:22:11,092 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:22:11,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:22:11,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:22:09" (1/3) ... [2019-01-02 00:22:11,094 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a5907ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:22:11, skipping insertion in model container [2019-01-02 00:22:11,094 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:22:11,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:10" (2/3) ... [2019-01-02 00:22:11,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a5907ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:22:11, skipping insertion in model container [2019-01-02 00:22:11,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:22:11,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:22:11" (3/3) ... [2019-01-02 00:22:11,099 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2019-01-02 00:22:11,171 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:22:11,172 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:22:11,172 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:22:11,172 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:22:11,172 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:22:11,173 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:22:11,173 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:22:11,174 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:22:11,174 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:22:11,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-01-02 00:22:11,221 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:22:11,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:11,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:11,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:11,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:11,230 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:22:11,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-01-02 00:22:11,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:22:11,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:11,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:11,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:11,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:11,240 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 6#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 16#L1065true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 15#L1066true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 8#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 18#L1076true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 7#L1470true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 27#L1471-3true [2019-01-02 00:22:11,240 INFO L796 eck$LassoCheckResult]: Loop: 27#L1471-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 21#L1471-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 27#L1471-3true [2019-01-02 00:22:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815372, now seen corresponding path program 1 times [2019-01-02 00:22:11,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:11,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:11,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:11,526 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-02 00:22:11,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:22:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:22:11,533 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:22:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-01-02 00:22:11,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:11,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:11,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:11,863 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-02 00:22:11,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:22:11,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:22:11,881 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2019-01-02 00:22:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:11,982 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-01-02 00:22:11,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:22:11,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-01-02 00:22:11,990 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2019-01-02 00:22:11,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2019-01-02 00:22:11,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-02 00:22:11,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-02 00:22:11,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-01-02 00:22:11,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:22:11,998 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-01-02 00:22:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-01-02 00:22:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-01-02 00:22:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:22:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-02 00:22:12,025 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-02 00:22:12,026 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-02 00:22:12,026 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:22:12,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-02 00:22:12,027 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:22:12,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:12,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:12,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:12,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:12,028 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 94#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 95#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 90#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 91#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 96#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 97#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 101#L1471-3 [2019-01-02 00:22:12,028 INFO L796 eck$LassoCheckResult]: Loop: 101#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 102#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 101#L1471-3 [2019-01-02 00:22:12,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813450, now seen corresponding path program 1 times [2019-01-02 00:22:12,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:12,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:12,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:12,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2019-01-02 00:22:12,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:12,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938732, now seen corresponding path program 1 times [2019-01-02 00:22:12,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:12,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:12,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:12,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:12,266 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-02 00:22:13,110 WARN L181 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-01-02 00:22:13,274 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-02 00:22:13,285 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:22:13,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:22:13,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:22:13,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:22:13,287 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:22:13,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:22:13,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:22:13,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:22:13,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:22:13,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:22:13,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:22:13,320 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-02 00:22:13,334 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-02 00:22:13,338 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-02 00:22:13,341 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-02 00:22:13,347 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-02 00:22:13,351 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-02 00:22:13,354 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-02 00:22:13,380 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-02 00:22:13,387 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-02 00:22:13,391 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-02 00:22:13,397 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-02 00:22:13,410 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-02 00:22:13,415 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-02 00:22:13,813 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-01-02 00:22:13,881 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-02 00:22:13,886 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-02 00:22:13,888 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-02 00:22:14,652 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-02 00:22:14,698 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:22:14,703 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:22:14,706 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-02 00:22:14,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:14,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:14,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:14,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,714 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-02 00:22:14,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,725 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-02 00:22:14,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,734 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-02 00:22:14,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:14,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:14,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:14,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,739 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-02 00:22:14,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,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-02 00:22:14,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:14,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:14,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:14,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,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-02 00:22:14,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,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-02 00:22:14,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,775 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-02 00:22:14,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:14,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:14,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:14,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,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-02 00:22:14,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,790 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-02 00:22:14,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,801 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-02 00:22:14,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,812 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-02 00:22:14,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:14,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,831 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-02 00:22:14,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:14,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:14,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:14,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:14,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:14,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:14,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:14,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:14,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:14,854 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-02 00:22:14,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:14,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:14,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:14,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:14,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:14,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:14,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:22:15,002 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-02 00:22:15,002 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:22:15,005 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:22:15,007 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:22:15,007 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:22:15,009 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~array~0.offset, v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1, ULTIMATE.start_entry_point_~i~2) = -1*ULTIMATE.start_entry_point_~array~0.offset + 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1 - 4*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2019-01-02 00:22:15,068 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-01-02 00:22:15,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:22:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:15,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:15,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:15,388 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-02 00:22:15,391 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-01-02 00:22:15,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-02 00:22:15,520 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 9 states. [2019-01-02 00:22:15,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:22:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:22:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-01-02 00:22:15,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-02 00:22:15,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:15,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-02 00:22:15,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:15,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-02 00:22:15,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:15,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-01-02 00:22:15,530 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-01-02 00:22:15,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 29 states and 37 transitions. [2019-01-02 00:22:15,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-02 00:22:15,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-02 00:22:15,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-01-02 00:22:15,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:22:15,533 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-01-02 00:22:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-01-02 00:22:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-01-02 00:22:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-02 00:22:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-01-02 00:22:15,537 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-02 00:22:15,537 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-02 00:22:15,537 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:22:15,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-01-02 00:22:15,538 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-02 00:22:15,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:15,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:15,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:15,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:22:15,539 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 243#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 244#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 239#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 240#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 245#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 246#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 249#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 256#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 235#L1444-3 [2019-01-02 00:22:15,539 INFO L796 eck$LassoCheckResult]: Loop: 235#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 237#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 247#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 248#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 234#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 235#L1444-3 [2019-01-02 00:22:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938674, now seen corresponding path program 1 times [2019-01-02 00:22:15,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:15,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:15,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:15,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:15,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:15,678 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-02 00:22:15,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:22:15,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:22:15,678 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:22:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:15,679 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 1 times [2019-01-02 00:22:15,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:15,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:15,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:15,873 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-02 00:22:16,048 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-02 00:22:16,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:22:16,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:22:16,049 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-02 00:22:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:16,137 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-01-02 00:22:16,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:22:16,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-01-02 00:22:16,141 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-02 00:22:16,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-01-02 00:22:16,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-02 00:22:16,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-02 00:22:16,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-01-02 00:22:16,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:22:16,144 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-02 00:22:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-01-02 00:22:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2019-01-02 00:22:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-02 00:22:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-01-02 00:22:16,149 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-01-02 00:22:16,149 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-01-02 00:22:16,149 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:22:16,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-01-02 00:22:16,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-02 00:22:16,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:16,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:16,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:16,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:22:16,154 INFO L794 eck$LassoCheckResult]: Stem: 332#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 323#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 324#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 321#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 322#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 339#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 343#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 342#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 340#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 317#L1444-3 [2019-01-02 00:22:16,154 INFO L796 eck$LassoCheckResult]: Loop: 317#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 319#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 330#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 331#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 316#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 317#L1444-3 [2019-01-02 00:22:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash -594068688, now seen corresponding path program 1 times [2019-01-02 00:22:16,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:16,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:16,384 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-02 00:22:16,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:22:16,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:22:16,385 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:22:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 2 times [2019-01-02 00:22:16,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:16,630 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-02 00:22:16,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:22:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:22:16,701 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-02 00:22:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:16,752 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-01-02 00:22:16,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:22:16,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-01-02 00:22:16,754 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-02 00:22:16,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 36 transitions. [2019-01-02 00:22:16,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-02 00:22:16,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-02 00:22:16,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2019-01-02 00:22:16,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:22:16,756 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-01-02 00:22:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2019-01-02 00:22:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-02 00:22:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-02 00:22:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-01-02 00:22:16,759 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-01-02 00:22:16,759 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-01-02 00:22:16,760 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:22:16,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-01-02 00:22:16,760 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-02 00:22:16,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:16,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:16,761 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:16,761 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-02 00:22:16,761 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 396#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 397#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 392#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 393#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 398#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 399#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 403#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 404#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 405#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 409#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 388#L1444-3 [2019-01-02 00:22:16,762 INFO L796 eck$LassoCheckResult]: Loop: 388#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 390#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 400#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 401#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 387#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 388#L1444-3 [2019-01-02 00:22:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:16,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1010756116, now seen corresponding path program 1 times [2019-01-02 00:22:16,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:16,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:16,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:16,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 3 times [2019-01-02 00:22:16,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:16,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:16,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash 754630971, now seen corresponding path program 1 times [2019-01-02 00:22:16,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:16,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:16,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:16,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:17,053 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-02 00:22:17,571 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2019-01-02 00:22:17,723 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-01-02 00:22:17,725 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:22:17,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:22:17,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:22:17,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:22:17,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:22:17,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:22:17,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:22:17,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:22:17,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-02 00:22:17,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:22:17,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:22:17,735 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-02 00:22:17,767 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-02 00:22:17,769 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-02 00:22:17,771 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-02 00:22:17,774 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-02 00:22:17,778 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-02 00:22:17,780 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-02 00:22:17,781 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-02 00:22:17,784 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-02 00:22:17,786 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-02 00:22:17,789 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-02 00:22:17,791 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-02 00:22:17,802 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-02 00:22:17,803 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-02 00:22:17,805 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-02 00:22:17,807 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-02 00:22:17,810 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-02 00:22:17,812 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-02 00:22:18,205 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-01-02 00:22:18,314 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-02 00:22:18,319 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-02 00:22:18,321 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-02 00:22:18,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-02 00:22:18,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-02 00:22:18,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-02 00:22:18,329 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-02 00:22:18,730 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-02 00:22:19,078 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-02 00:22:19,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:22:19,373 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:22:19,374 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-02 00:22:19,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,381 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-02 00:22:19,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,389 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-02 00:22:19,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,394 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-02 00:22:19,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,402 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-02 00:22:19,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,409 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-02 00:22:19,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,415 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-02 00:22:19,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,421 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-02 00:22:19,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,429 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-02 00:22:19,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,431 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-02 00:22:19,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,441 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-02 00:22:19,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,446 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-02 00:22:19,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,454 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-02 00:22:19,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,458 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-02 00:22:19,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:19,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:19,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:19,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:19,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:19,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,493 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-02 00:22:19,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:22:19,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,503 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-01-02 00:22:19,503 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-02 00:22:19,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:19,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,549 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-02 00:22:19,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,556 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-02 00:22:19,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,563 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-02 00:22:19,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,569 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-02 00:22:19,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:19,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,581 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-02 00:22:19,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,588 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-02 00:22:19,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,597 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-02 00:22:19,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,603 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-02 00:22:19,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,612 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-02 00:22:19,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,620 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-02 00:22:19,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:19,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:19,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:19,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:19,625 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-02 00:22:19,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:19,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:19,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:19,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:19,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:19,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:19,705 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:22:19,766 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:22:19,767 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-02 00:22:19,767 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:22:19,771 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:22:19,771 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:22:19,772 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2019-01-02 00:22:20,009 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:22:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:20,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:20,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:20,495 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-02 00:22:20,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:22:20,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-02 00:22:20,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 6 states. [2019-01-02 00:22:20,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:22:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:22:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-01-02 00:22:20,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-02 00:22:20,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:20,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-02 00:22:20,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:20,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-02 00:22:20,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:20,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2019-01-02 00:22:20,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-02 00:22:20,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 31 states and 40 transitions. [2019-01-02 00:22:20,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-02 00:22:20,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-02 00:22:20,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-01-02 00:22:20,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:22:20,632 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-01-02 00:22:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-01-02 00:22:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-01-02 00:22:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-02 00:22:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-02 00:22:20,638 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-02 00:22:20,638 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-02 00:22:20,638 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:22:20,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-02 00:22:20,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:22:20,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:20,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:20,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:20,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:20,641 INFO L794 eck$LassoCheckResult]: Stem: 581#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 572#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 573#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 568#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 569#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 574#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 575#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 580#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 582#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 583#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 587#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 563#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 564#L1444-4 alloc_17_#res := 0; 567#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 586#L1460-3 [2019-01-02 00:22:20,641 INFO L796 eck$LassoCheckResult]: Loop: 586#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 585#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 586#L1460-3 [2019-01-02 00:22:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash -580221115, now seen corresponding path program 1 times [2019-01-02 00:22:20,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:20,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:20,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:22:20,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:22:20,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:22:20,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:22:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2019-01-02 00:22:20,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:20,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:20,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:21,108 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-02 00:22:21,278 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-02 00:22:21,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:22:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:22:21,279 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-02 00:22:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:21,375 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-01-02 00:22:21,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:22:21,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2019-01-02 00:22:21,377 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-01-02 00:22:21,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 86 transitions. [2019-01-02 00:22:21,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-01-02 00:22:21,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-01-02 00:22:21,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2019-01-02 00:22:21,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:22:21,379 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2019-01-02 00:22:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2019-01-02 00:22:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-02 00:22:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-02 00:22:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-01-02 00:22:21,382 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-02 00:22:21,383 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-02 00:22:21,383 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:22:21,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-01-02 00:22:21,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:22:21,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:21,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:21,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:21,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:21,384 INFO L794 eck$LassoCheckResult]: Stem: 688#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 679#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 680#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 675#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 676#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 682#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 683#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 698#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 691#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 692#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 699#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 700#L1444-3 assume !(alloc_17_~i~0 < alloc_17_~len); 673#L1444-4 alloc_17_#res := 0; 674#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 695#L1460-3 [2019-01-02 00:22:21,385 INFO L796 eck$LassoCheckResult]: Loop: 695#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 694#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 695#L1460-3 [2019-01-02 00:22:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash -838386553, now seen corresponding path program 1 times [2019-01-02 00:22:21,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:21,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:22:21,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:22:21,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:22:21,499 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:22:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2019-01-02 00:22:21,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:22:21,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:22:21,598 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-01-02 00:22:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:21,650 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-01-02 00:22:21,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:22:21,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2019-01-02 00:22:21,652 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-02 00:22:21,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2019-01-02 00:22:21,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-02 00:22:21,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-02 00:22:21,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2019-01-02 00:22:21,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:22:21,654 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-01-02 00:22:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2019-01-02 00:22:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-01-02 00:22:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-02 00:22:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-02 00:22:21,660 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-02 00:22:21,661 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-02 00:22:21,661 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:22:21,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-02 00:22:21,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:22:21,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:21,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:21,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:21,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:21,662 INFO L794 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 777#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 778#L1065 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 775#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 776#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 781#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 782#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 788#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 789#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 790#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 794#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 770#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 771#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 783#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 784#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 795#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 780#L1451-3 [2019-01-02 00:22:21,662 INFO L796 eck$LassoCheckResult]: Loop: 780#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 779#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 780#L1451-3 [2019-01-02 00:22:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash 754690497, now seen corresponding path program 1 times [2019-01-02 00:22:21,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:21,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:21,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:21,690 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2019-01-02 00:22:21,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:21,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash -591903197, now seen corresponding path program 1 times [2019-01-02 00:22:21,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:21,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:22:21,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:22:21,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-02 00:22:22,072 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-02 00:22:22,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:22:22,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:22:22,100 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-02 00:22:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:22,266 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-01-02 00:22:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-02 00:22:22,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2019-01-02 00:22:22,269 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-01-02 00:22:22,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2019-01-02 00:22:22,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-01-02 00:22:22,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-02 00:22:22,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2019-01-02 00:22:22,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:22:22,271 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-01-02 00:22:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2019-01-02 00:22:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2019-01-02 00:22:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-02 00:22:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-01-02 00:22:22,278 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-01-02 00:22:22,278 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-01-02 00:22:22,278 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:22:22,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2019-01-02 00:22:22,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:22:22,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:22,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:22,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:22,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:22,281 INFO L794 eck$LassoCheckResult]: Stem: 911#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 900#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 901#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 902#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 920#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 921#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 912#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 913#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 925#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 923#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 924#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 891#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 892#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 907#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 908#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 928#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 916#L1451-3 assume !(alloc_17_~j~0 >= 0); 917#L1451-4 alloc_17_#res := 3; 897#L1455 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 919#L1460-3 [2019-01-02 00:22:22,281 INFO L796 eck$LassoCheckResult]: Loop: 919#L1460-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 918#L1460-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 919#L1460-3 [2019-01-02 00:22:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash 419216258, now seen corresponding path program 1 times [2019-01-02 00:22:22,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:22,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:22,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 3 times [2019-01-02 00:22:22,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:22,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:22,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:22,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash -860099164, now seen corresponding path program 1 times [2019-01-02 00:22:22,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:22,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:22,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:22,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:23,121 WARN L181 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 156 [2019-01-02 00:22:23,347 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-02 00:22:23,350 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:22:23,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:22:23,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:22:23,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:22:23,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:22:23,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:22:23,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:22:23,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:22:23,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration9_Lasso [2019-01-02 00:22:23,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:22:23,351 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:22:23,356 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-02 00:22:23,392 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-02 00:22:23,426 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-02 00:22:23,451 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-02 00:22:23,488 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-02 00:22:23,514 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-02 00:22:23,540 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-02 00:22:23,544 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-02 00:22:23,546 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-02 00:22:23,549 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-02 00:22:23,551 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-02 00:22:23,557 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-02 00:22:23,560 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-02 00:22:23,562 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-02 00:22:23,565 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-02 00:22:23,567 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-02 00:22:23,569 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-02 00:22:23,571 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-02 00:22:23,574 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-02 00:22:23,576 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-02 00:22:23,579 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-02 00:22:23,582 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-02 00:22:23,586 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-02 00:22:23,597 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-02 00:22:23,599 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-02 00:22:23,602 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-02 00:22:23,608 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-02 00:22:23,987 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-01-02 00:22:24,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-02 00:22:24,053 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-02 00:22:24,058 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-02 00:22:24,103 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-02 00:22:24,628 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-02 00:22:24,960 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-02 00:22:25,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:22:25,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:22:25,102 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-02 00:22:25,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,109 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-02 00:22:25,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,112 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-02 00:22:25,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,114 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-02 00:22:25,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,116 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-02 00:22:25,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,118 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-02 00:22:25,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,120 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-02 00:22:25,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,122 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-02 00:22:25,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,125 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-02 00:22:25,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,128 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-02 00:22:25,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,129 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-02 00:22:25,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,133 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-02 00:22:25,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,135 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-02 00:22:25,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,137 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-02 00:22:25,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,139 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-02 00:22:25,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,141 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-02 00:22:25,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,142 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-02 00:22:25,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,144 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-02 00:22:25,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,146 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-02 00:22:25,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,148 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-02 00:22:25,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,149 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-02 00:22:25,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,151 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-02 00:22:25,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,154 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-02 00:22:25,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,155 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-02 00:22:25,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,157 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-02 00:22:25,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,160 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-02 00:22:25,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,163 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-02 00:22:25,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,166 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-02 00:22:25,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,171 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-02 00:22:25,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,174 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-02 00:22:25,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,177 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-02 00:22:25,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,179 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-02 00:22:25,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,181 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-02 00:22:25,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,184 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-02 00:22:25,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,184 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-02 00:22:25,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,186 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-02 00:22:25,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,194 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-02 00:22:25,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,196 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-02 00:22:25,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:25,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:25,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:25,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:25,197 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-02 00:22:25,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:25,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:25,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:25,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:25,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:25,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:25,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:22:25,226 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:22:25,226 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:22:25,227 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:22:25,227 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:22:25,228 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:22:25,228 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2019-01-02 00:22:25,478 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:22:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:25,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:25,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:25,591 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-02 00:22:25,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:22:25,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-02 00:22:25,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 49 states and 64 transitions. Complement of second has 4 states. [2019-01-02 00:22:25,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:22:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:22:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2019-01-02 00:22:25,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 2 letters. [2019-01-02 00:22:25,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:25,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 2 letters. [2019-01-02 00:22:25,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:25,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-02 00:22:25,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:25,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2019-01-02 00:22:25,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:22:25,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 27 transitions. [2019-01-02 00:22:25,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-02 00:22:25,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-02 00:22:25,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2019-01-02 00:22:25,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:22:25,614 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-02 00:22:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2019-01-02 00:22:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-02 00:22:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:22:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-01-02 00:22:25,616 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-02 00:22:25,616 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-02 00:22:25,616 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-02 00:22:25,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-01-02 00:22:25,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:22:25,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:25,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:25,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:25,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:25,621 INFO L794 eck$LassoCheckResult]: Stem: 1122#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1113#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1114#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1109#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1110#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1115#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1116#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1121#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1123#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1124#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1125#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1106#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1107#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1119#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1120#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1104#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1105#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1108#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1117#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1118#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1126#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1112#L1451-3 [2019-01-02 00:22:25,621 INFO L796 eck$LassoCheckResult]: Loop: 1112#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1111#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1112#L1451-3 [2019-01-02 00:22:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash 718228858, now seen corresponding path program 1 times [2019-01-02 00:22:25,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:25,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:25,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:25,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:25,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-02 00:22:25,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:22:25,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:22:25,682 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:22:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2019-01-02 00:22:25,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:25,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:25,877 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-02 00:22:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:22:25,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:22:25,920 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-02 00:22:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:26,122 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-02 00:22:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:22:26,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2019-01-02 00:22:26,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:22:26,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 31 transitions. [2019-01-02 00:22:26,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-02 00:22:26,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-02 00:22:26,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-01-02 00:22:26,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:22:26,125 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-02 00:22:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-01-02 00:22:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-01-02 00:22:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:22:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-02 00:22:26,130 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-02 00:22:26,132 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-02 00:22:26,132 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-02 00:22:26,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-01-02 00:22:26,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:22:26,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:26,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:26,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:26,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:26,133 INFO L794 eck$LassoCheckResult]: Stem: 1183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1175#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1176#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1171#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1172#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1177#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1178#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1184#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1185#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1186#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1187#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1168#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1169#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1181#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1182#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1166#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1167#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1170#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1179#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1180#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1188#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1174#L1451-3 [2019-01-02 00:22:26,133 INFO L796 eck$LassoCheckResult]: Loop: 1174#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1173#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1174#L1451-3 [2019-01-02 00:22:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:26,134 INFO L82 PathProgramCache]: Analyzing trace with hash 38170488, now seen corresponding path program 1 times [2019-01-02 00:22:26,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:26,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:26,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:22:26,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:22:26,319 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-02 00:22:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:26,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:22:26,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:22:26,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-01-02 00:22:26,576 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:22:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 3 times [2019-01-02 00:22:26,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:26,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:26,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-02 00:22:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-01-02 00:22:26,722 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 15 states. [2019-01-02 00:22:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:22:27,045 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-01-02 00:22:27,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-02 00:22:27,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-01-02 00:22:27,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:22:27,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 29 transitions. [2019-01-02 00:22:27,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-02 00:22:27,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-02 00:22:27,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-01-02 00:22:27,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:22:27,048 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-02 00:22:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-01-02 00:22:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-02 00:22:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-02 00:22:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-02 00:22:27,053 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-02 00:22:27,053 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-02 00:22:27,053 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-02 00:22:27,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2019-01-02 00:22:27,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:22:27,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:27,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:27,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:27,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:22:27,054 INFO L794 eck$LassoCheckResult]: Stem: 1332#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1324#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1325#L1065 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1320#L1066 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1321#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1326#L1076 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1327#L1470 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1333#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1334#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1335#L1471-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1336#L1471-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1339#L1471-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1337#L1471-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1317#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1318#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1330#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1331#L1446 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1315#L1444-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1316#L1444-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1319#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1328#L1076-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1329#L1446 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1338#L1446-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1323#L1451-3 [2019-01-02 00:22:27,060 INFO L796 eck$LassoCheckResult]: Loop: 1323#L1451-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1322#L1451-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1323#L1451-3 [2019-01-02 00:22:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2124874406, now seen corresponding path program 2 times [2019-01-02 00:22:27,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:27,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:27,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:27,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:27,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:27,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:27,096 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 4 times [2019-01-02 00:22:27,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:27,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:27,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:27,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:27,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836356, now seen corresponding path program 1 times [2019-01-02 00:22:27,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:27,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:27,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:22:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:27,541 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-02 00:22:29,624 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 245 DAG size of output: 209 [2019-01-02 00:22:29,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-02 00:22:29,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-02 00:22:30,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-02 00:22:30,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-02 00:22:30,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-02 00:22:30,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:311, output treesize:303 [2019-01-02 00:22:30,642 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-02 00:22:30,646 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:22:30,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:22:30,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:22:30,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:22:30,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:22:30,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:22:30,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:22:30,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:22:30,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2_true-valid-memsafety_true-termination.i_Iteration12_Lasso [2019-01-02 00:22:30,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:22:30,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:22:30,656 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-02 00:22:30,675 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-02 00:22:30,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-02 00:22:30,680 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-02 00:22:30,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-02 00:22:30,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-02 00:22:30,689 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-02 00:22:30,695 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-02 00:22:30,698 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-02 00:22:30,701 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-02 00:22:30,716 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-02 00:22:30,723 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-02 00:22:30,725 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-02 00:22:30,728 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-02 00:22:30,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-02 00:22:30,735 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-02 00:22:30,739 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-02 00:22:30,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-02 00:22:30,744 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-02 00:22:30,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-02 00:22:31,121 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-01-02 00:22:31,224 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-02 00:22:31,227 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-02 00:22:31,230 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-02 00:22:31,232 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-02 00:22:31,233 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-02 00:22:31,236 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-02 00:22:31,238 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-02 00:22:31,241 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-02 00:22:31,523 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-01-02 00:22:32,263 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-02 00:22:32,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:22:32,286 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:22:32,286 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-02 00:22:32,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,288 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-02 00:22:32,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,291 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-02 00:22:32,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,293 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-02 00:22:32,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,295 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-02 00:22:32,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,297 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-02 00:22:32,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,299 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-02 00:22:32,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,302 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-02 00:22:32,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,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-02 00:22:32,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,307 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-02 00:22:32,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,309 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-02 00:22:32,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,311 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-02 00:22:32,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,313 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-02 00:22:32,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,316 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-02 00:22:32,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,317 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-02 00:22:32,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,319 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-02 00:22:32,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,321 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-02 00:22:32,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,322 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-02 00:22:32,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,324 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-02 00:22:32,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,327 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-02 00:22:32,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,330 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-02 00:22:32,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,332 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-02 00:22:32,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:32,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:32,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:32,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,333 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-02 00:22:32,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:32,336 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-02 00:22:32,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:32,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:32,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:32,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:32,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:32,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:32,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:22:32,357 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:22:32,358 INFO L444 ModelExtractionUtils]: 40 out of 43 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:22:32,358 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:22:32,359 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:22:32,359 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:22:32,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2019-01-02 00:22:32,625 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:22:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:32,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:32,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:32,708 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-02 00:22:32,709 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:22:32,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-02 00:22:32,728 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 31 transitions. Complement of second has 4 states. [2019-01-02 00:22:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:22:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:22:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-02 00:22:32,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 2 letters. [2019-01-02 00:22:32,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:32,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 25 letters. Loop has 2 letters. [2019-01-02 00:22:32,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:32,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 4 letters. [2019-01-02 00:22:32,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:32,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-01-02 00:22:32,731 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:22:32,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-01-02 00:22:32,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:22:32,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:22:32,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:22:32,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:22:32,735 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:22:32,735 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:22:32,735 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:22:32,735 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-02 00:22:32,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:22:32,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:22:32,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:22:32,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:22:32 BoogieIcfgContainer [2019-01-02 00:22:32,743 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:22:32,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:22:32,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:22:32,744 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:22:32,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:22:11" (3/4) ... [2019-01-02 00:22:32,755 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:22:32,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:22:32,756 INFO L168 Benchmark]: Toolchain (without parser) took 23218.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.4 MB). Free memory was 947.3 MB in the beginning and 934.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 365.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:32,757 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:22:32,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 893.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:32,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:22:32,759 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:22:32,760 INFO L168 Benchmark]: RCFGBuilder took 526.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:32,760 INFO L168 Benchmark]: BuchiAutomizer took 21655.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.0 GB in the beginning and 934.8 MB in the end (delta: 112.6 MB). Peak memory consumption was 359.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:32,761 INFO L168 Benchmark]: Witness Printer took 11.52 ms. Allocated memory is still 1.4 GB. Free memory is still 934.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:22:32,769 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 893.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 526.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21655.65 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.0 GB in the beginning and 934.8 MB in the end (delta: 112.6 MB). Peak memory consumption was 359.0 MB. Max. memory is 11.5 GB. * Witness Printer took 11.52 ms. Allocated memory is still 1.4 GB. Free memory is still 934.8 MB. 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * array + unknown-#length-unknown[malloc(size)] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.5s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 18.9s. Construction of modules took 0.7s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 126 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 343 SDtfs, 519 SDslu, 544 SDs, 0 SdLazy, 320 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax110 hnf100 lsp83 ukn60 mio100 lsp54 div100 bol100 ite100 ukn100 eq193 hnf88 smp98 dnf161 smp77 tf100 neg98 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 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...