./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -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 ed765f1987456e72af41b47c4e2a2164d166c0f3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:47:21,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:47:21,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:47:21,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:47:21,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:47:21,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:47:21,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:47:21,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:47:21,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:47:21,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:47:21,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:47:21,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:47:21,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:47:21,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:47:21,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:47:21,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:47:21,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:47:21,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:47:21,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:47:21,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:47:21,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:47:21,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:47:21,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:47:21,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:47:21,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:47:21,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:47:21,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:47:21,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:47:21,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:47:21,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:47:21,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:47:21,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:47:21,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:47:21,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:47:21,560 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:47:21,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:47:21,561 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:47:21,579 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:47:21,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:47:21,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:47:21,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:47:21,583 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:47:21,583 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:47:21,583 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:47:21,583 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:47:21,584 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:47:21,584 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:47:21,584 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:47:21,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:47:21,584 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:47:21,584 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:47:21,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:47:21,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:47:21,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:47:21,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:47:21,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:47:21,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:47:21,588 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:47:21,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:47:21,589 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:47:21,589 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:47:21,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:47:21,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:47:21,589 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:47:21,590 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:47:21,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:47:21,590 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:47:21,590 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:47:21,592 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:47:21,595 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 -> ed765f1987456e72af41b47c4e2a2164d166c0f3 [2019-01-14 04:47:21,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:47:21,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:47:21,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:47:21,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:47:21,691 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:47:21,692 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2019-01-14 04:47:21,747 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b2c8fcd/51bdaef964494875b688952c4e62a6de/FLAGc942598de [2019-01-14 04:47:22,284 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:47:22,285 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2019-01-14 04:47:22,302 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b2c8fcd/51bdaef964494875b688952c4e62a6de/FLAGc942598de [2019-01-14 04:47:22,554 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b2c8fcd/51bdaef964494875b688952c4e62a6de [2019-01-14 04:47:22,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:47:22,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:47:22,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:22,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:47:22,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:47:22,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:22" (1/1) ... [2019-01-14 04:47:22,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1021a89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:22, skipping insertion in model container [2019-01-14 04:47:22,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:47:22" (1/1) ... [2019-01-14 04:47:22,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:47:22,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:47:22,892 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:22,903 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:47:22,976 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:47:23,004 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:47:23,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23 WrapperNode [2019-01-14 04:47:23,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:47:23,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:23,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:47:23,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:47:23,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:47:23,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:47:23,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:47:23,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:47:23,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (1/1) ... [2019-01-14 04:47:23,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:47:23,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:47:23,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:47:23,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:47:23,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (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-14 04:47:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:47:23,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:47:24,417 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:47:24,417 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-14 04:47:24,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:24 BoogieIcfgContainer [2019-01-14 04:47:24,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:47:24,419 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:47:24,419 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:47:24,423 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:47:24,424 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:24,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:47:22" (1/3) ... [2019-01-14 04:47:24,426 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66c08d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:24, skipping insertion in model container [2019-01-14 04:47:24,426 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:24,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:47:23" (2/3) ... [2019-01-14 04:47:24,428 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66c08d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:47:24, skipping insertion in model container [2019-01-14 04:47:24,428 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:47:24,428 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:24" (3/3) ... [2019-01-14 04:47:24,431 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2019-01-14 04:47:24,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:47:24,494 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:47:24,494 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:47:24,494 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:47:24,494 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:47:24,494 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:47:24,494 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:47:24,495 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:47:24,495 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:47:24,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states. [2019-01-14 04:47:24,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-01-14 04:47:24,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:24,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:24,549 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:24,549 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:24,549 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:47:24,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states. [2019-01-14 04:47:24,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2019-01-14 04:47:24,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:24,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:24,561 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:47:24,561 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:24,571 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 80#L292true assume !(0 == ~r1~0);init_~tmp~0 := 0; 77#L292-1true init_#res := init_~tmp~0; 97#L421true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 71#L490-2true [2019-01-14 04:47:24,572 INFO L796 eck$LassoCheckResult]: Loop: 71#L490-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 105#L118true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 32#L122true assume !(node1_~m1~0 != ~nomsg~0); 46#L122-1true ~mode1~0 := 0; 90#L118-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 35#L155true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 23#L158true assume !(node2_~m2~0 != ~nomsg~0); 22#L158-1true ~mode2~0 := 0; 47#L155-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 115#L189true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 120#L192true assume !(node3_~m3~0 != ~nomsg~0); 119#L192-1true ~mode3~0 := 0; 113#L189-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 92#L223true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 76#L226true assume !(node4_~m4~0 != ~nomsg~0); 73#L226-1true ~mode4~0 := 0; 66#L223-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 43#L257true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 31#L260true assume !(node5_~m5~0 != ~nomsg~0); 30#L260-1true ~mode5~0 := 0; 42#L257-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 101#L429true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 102#L429-1true check_#res := check_~tmp~1; 49#L441true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 94#L520true assume !(0 == assert_~arg % 256); 64#L515true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 71#L490-2true [2019-01-14 04:47:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 28880448, now seen corresponding path program 1 times [2019-01-14 04:47:24,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:24,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:24,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:24,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:24,863 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-14 04:47:24,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:24,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:24,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:47:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:24,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1515995822, now seen corresponding path program 1 times [2019-01-14 04:47:24,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:24,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:24,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:25,114 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-14 04:47:25,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:25,117 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:25,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:47:25,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:47:25,137 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 4 states. [2019-01-14 04:47:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:25,527 INFO L93 Difference]: Finished difference Result 121 states and 200 transitions. [2019-01-14 04:47:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:47:25,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 200 transitions. [2019-01-14 04:47:25,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:47:25,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 114 states and 162 transitions. [2019-01-14 04:47:25,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2019-01-14 04:47:25,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2019-01-14 04:47:25,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 162 transitions. [2019-01-14 04:47:25,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:25,550 INFO L706 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-01-14 04:47:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 162 transitions. [2019-01-14 04:47:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 04:47:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 04:47:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2019-01-14 04:47:25,584 INFO L729 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-01-14 04:47:25,584 INFO L609 BuchiCegarLoop]: Abstraction has 114 states and 162 transitions. [2019-01-14 04:47:25,584 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:47:25,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 162 transitions. [2019-01-14 04:47:25,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:47:25,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:25,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:25,590 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:25,590 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:25,591 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 274#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 275#L292 assume 0 == ~r1~0; 287#L293 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 288#L294 assume ~id1~0 >= 0; 337#L295 assume 0 == ~st1~0; 270#L296 assume ~send1~0 == ~id1~0; 271#L297 assume 0 == ~mode1~0 % 256; 340#L298 assume ~id2~0 >= 0; 282#L299 assume 0 == ~st2~0; 283#L300 assume ~send2~0 == ~id2~0; 326#L301 assume 0 == ~mode2~0 % 256; 327#L302 assume ~id3~0 >= 0; 345#L303 assume 0 == ~st3~0; 298#L304 assume ~send3~0 == ~id3~0; 299#L305 assume 0 == ~mode3~0 % 256; 342#L306 assume ~id4~0 >= 0; 280#L307 assume 0 == ~st4~0; 281#L308 assume ~send4~0 == ~id4~0; 339#L309 assume 0 == ~mode4~0 % 256; 268#L310 assume ~id5~0 >= 0; 269#L311 assume 0 == ~st5~0; 314#L312 assume ~send5~0 == ~id5~0; 315#L313 assume 0 == ~mode5~0 % 256; 357#L314 assume ~id1~0 != ~id2~0; 296#L315 assume ~id1~0 != ~id3~0; 297#L316 assume ~id1~0 != ~id4~0; 341#L317 assume ~id1~0 != ~id5~0; 276#L318 assume ~id2~0 != ~id3~0; 277#L319 assume ~id2~0 != ~id4~0; 338#L320 assume ~id2~0 != ~id5~0; 263#L321 assume ~id3~0 != ~id4~0; 264#L322 assume ~id3~0 != ~id5~0; 310#L323 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 311#L292-1 init_#res := init_~tmp~0; 356#L421 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 347#L490-2 [2019-01-14 04:47:25,591 INFO L796 eck$LassoCheckResult]: Loop: 347#L490-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 353#L118 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 307#L122 assume !(node1_~m1~0 != ~nomsg~0); 309#L122-1 ~mode1~0 := 0; 328#L118-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 316#L155 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 290#L158 assume !(node2_~m2~0 != ~nomsg~0); 289#L158-1 ~mode2~0 := 0; 285#L155-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 329#L189 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 368#L192 assume !(node3_~m3~0 != ~nomsg~0); 261#L192-1 ~mode3~0 := 0; 358#L189-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 363#L223 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 355#L226 assume !(node4_~m4~0 != ~nomsg~0); 301#L226-1 ~mode4~0 := 0; 317#L223-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 323#L257 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 305#L260 assume !(node5_~m5~0 != ~nomsg~0); 303#L260-1 ~mode5~0 := 0; 304#L257-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 322#L429 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 325#L429-1 check_#res := check_~tmp~1; 332#L441 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 333#L520 assume !(0 == assert_~arg % 256); 346#L515 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 347#L490-2 [2019-01-14 04:47:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 1 times [2019-01-14 04:47:25,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:25,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:25,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:25,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1515995822, now seen corresponding path program 2 times [2019-01-14 04:47:25,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:25,893 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-14 04:47:25,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:25,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:47:25,895 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:47:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:47:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:47:25,897 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. cyclomatic complexity: 49 Second operand 5 states. [2019-01-14 04:47:26,200 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:47:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:26,293 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions. [2019-01-14 04:47:26,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:47:26,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 164 transitions. [2019-01-14 04:47:26,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:47:26,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 114 states and 160 transitions. [2019-01-14 04:47:26,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2019-01-14 04:47:26,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2019-01-14 04:47:26,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 160 transitions. [2019-01-14 04:47:26,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:26,309 INFO L706 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-01-14 04:47:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 160 transitions. [2019-01-14 04:47:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 04:47:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 04:47:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-01-14 04:47:26,328 INFO L729 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-01-14 04:47:26,328 INFO L609 BuchiCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-01-14 04:47:26,329 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:47:26,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 160 transitions. [2019-01-14 04:47:26,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2019-01-14 04:47:26,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:47:26,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:47:26,334 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:26,334 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:47:26,336 INFO L794 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 517#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 518#L292 assume 0 == ~r1~0; 530#L293 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 531#L294 assume ~id1~0 >= 0; 580#L295 assume 0 == ~st1~0; 513#L296 assume ~send1~0 == ~id1~0; 514#L297 assume 0 == ~mode1~0 % 256; 583#L298 assume ~id2~0 >= 0; 525#L299 assume 0 == ~st2~0; 526#L300 assume ~send2~0 == ~id2~0; 569#L301 assume 0 == ~mode2~0 % 256; 570#L302 assume ~id3~0 >= 0; 588#L303 assume 0 == ~st3~0; 541#L304 assume ~send3~0 == ~id3~0; 542#L305 assume 0 == ~mode3~0 % 256; 585#L306 assume ~id4~0 >= 0; 523#L307 assume 0 == ~st4~0; 524#L308 assume ~send4~0 == ~id4~0; 582#L309 assume 0 == ~mode4~0 % 256; 511#L310 assume ~id5~0 >= 0; 512#L311 assume 0 == ~st5~0; 557#L312 assume ~send5~0 == ~id5~0; 558#L313 assume 0 == ~mode5~0 % 256; 600#L314 assume ~id1~0 != ~id2~0; 539#L315 assume ~id1~0 != ~id3~0; 540#L316 assume ~id1~0 != ~id4~0; 584#L317 assume ~id1~0 != ~id5~0; 519#L318 assume ~id2~0 != ~id3~0; 520#L319 assume ~id2~0 != ~id4~0; 581#L320 assume ~id2~0 != ~id5~0; 506#L321 assume ~id3~0 != ~id4~0; 507#L322 assume ~id3~0 != ~id5~0; 553#L323 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 554#L292-1 init_#res := init_~tmp~0; 599#L421 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 590#L490-2 [2019-01-14 04:47:26,339 INFO L796 eck$LassoCheckResult]: Loop: 590#L490-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 596#L118 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 550#L122 assume !(node1_~m1~0 != ~nomsg~0); 552#L122-1 ~mode1~0 := 0; 571#L118-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 559#L155 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 533#L158 assume !(node2_~m2~0 != ~nomsg~0); 532#L158-1 ~mode2~0 := 0; 528#L155-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 572#L189 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 611#L192 assume !(node3_~m3~0 != ~nomsg~0); 504#L192-1 ~mode3~0 := 0; 601#L189-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 606#L223 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 598#L226 assume !(node4_~m4~0 != ~nomsg~0); 544#L226-1 ~mode4~0 := 0; 560#L223-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 566#L257 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 548#L260 assume !(node5_~m5~0 != ~nomsg~0); 546#L260-1 ~mode5~0 := 0; 547#L257-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 565#L429 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 577#L430 assume ~r1~0 < 5;check_~tmp~1 := 1; 568#L429-1 check_#res := check_~tmp~1; 575#L441 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 576#L520 assume !(0 == assert_~arg % 256); 589#L515 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 590#L490-2 [2019-01-14 04:47:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 766937493, now seen corresponding path program 2 times [2019-01-14 04:47:26,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:26,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:26,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:26,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash -632096835, now seen corresponding path program 1 times [2019-01-14 04:47:26,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:26,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:47:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:47:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash -525921879, now seen corresponding path program 1 times [2019-01-14 04:47:26,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:47:26,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:47:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:47:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:47:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:26,640 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-14 04:47:26,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:47:26,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:47:27,375 WARN L181 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2019-01-14 04:47:28,755 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 123 DAG size of output: 118 [2019-01-14 04:47:28,776 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:47:28,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:47:28,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:47:28,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:47:28,777 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:47:28,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:28,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:47:28,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:47:28,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2019-01-14 04:47:28,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:47:28,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:47:28,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-14 04:47:28,834 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-14 04:47:28,837 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-14 04:47:28,841 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-14 04:47:28,852 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-14 04:47:28,870 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-14 04:47:28,958 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-14 04:47:28,963 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-14 04:47:28,974 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-14 04:47:28,978 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-14 04:47:28,981 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-14 04:47:28,988 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-14 04:47:28,994 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-14 04:47:29,023 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-14 04:47:29,029 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-14 04:47:29,036 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-14 04:47:29,039 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-14 04:47:29,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-14 04:47:29,061 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-14 04:47:29,113 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-14 04:47:29,121 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-14 04:47:29,127 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-14 04:47:29,128 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-14 04:47:29,131 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-14 04:47:29,135 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-14 04:47:29,137 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-14 04:47:29,140 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-14 04:47:29,146 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-14 04:47:29,150 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-14 04:47:29,154 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-14 04:47:29,157 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-14 04:47:29,159 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-14 04:47:29,163 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-14 04:47:29,588 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 04:47:29,950 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 04:47:30,033 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:47:30,034 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:30,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:47:30,050 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:30,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:47:30,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:47:30,251 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:47:30,254 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:47:30,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:47:30,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:47:30,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:47:30,254 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:47:30,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:47:30,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:47:30,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:47:30,255 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c_Iteration3_Loop [2019-01-14 04:47:30,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:47:30,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:47:30,265 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-14 04:47:30,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:30,332 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-14 04:47:30,381 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-14 04:47:30,394 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-14 04:47:30,400 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-14 04:47:30,402 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-14 04:47:30,405 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-14 04:47:30,511 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-14 04:47:30,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-14 04:47:30,563 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-14 04:47:30,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-14 04:47:30,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-14 04:47:30,572 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-14 04:47:30,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-14 04:47:30,577 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-14 04:47:30,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-14 04:47:30,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-14 04:47:30,589 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-14 04:47:30,595 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-14 04:47:30,604 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-14 04:47:30,606 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-14 04:47:30,617 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-14 04:47:30,620 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-14 04:47:30,625 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-14 04:47:30,629 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-14 04:47:30,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:47:30,640 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-14 04:47:30,643 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-14 04:47:30,645 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-14 04:47:30,651 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-14 04:47:30,659 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-14 04:47:30,661 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-14 04:47:30,856 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 04:47:31,418 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 04:47:31,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:47:31,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:47:31,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:47:31,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:47:31,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:47:31,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:47:31,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:47:31,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:47:31,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,736 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:47:31,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:47:31,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:47:31,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:47:31,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,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-14 04:47:31,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:47:31,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:47:31,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:47:31,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:47:31,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-14 04:47:31,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:47:31,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:47:31,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:47:31,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:47:31,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:47:31,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:47:31,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:47:31,809 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:47:31,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:47:31,814 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:47:31,818 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:47:31,819 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:47:31,819 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:47:31,820 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2019-01-14 04:47:31,821 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:47:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:47:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:32,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:47:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:47:32,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:47:32,248 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-14 04:47:32,252 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-14 04:47:32,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 160 transitions. cyclomatic complexity: 47 Second operand 3 states. [2019-01-14 04:47:32,352 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 160 transitions. cyclomatic complexity: 47. Second operand 3 states. Result 192 states and 285 transitions. Complement of second has 4 states. [2019-01-14 04:47:32,356 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-14 04:47:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:47:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2019-01-14 04:47:32,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 36 letters. Loop has 27 letters. [2019-01-14 04:47:32,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:47:32,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 63 letters. Loop has 27 letters. [2019-01-14 04:47:32,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:47:32,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 160 transitions. Stem has 36 letters. Loop has 54 letters. [2019-01-14 04:47:32,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:47:32,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 285 transitions. [2019-01-14 04:47:32,369 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:47:32,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 0 states and 0 transitions. [2019-01-14 04:47:32,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:47:32,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:47:32,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:47:32,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:32,369 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:32,369 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:32,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:47:32,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:47:32,372 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:47:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:47:32,372 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:47:32,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:47:32,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:47:32,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:47:32,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:47:32,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:47:32,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:47:32,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:47:32,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:47:32,375 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:32,375 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:32,375 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:47:32,375 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:47:32,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:47:32,378 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:47:32,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:47:32,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:47:32 BoogieIcfgContainer [2019-01-14 04:47:32,386 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:47:32,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:47:32,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:47:32,387 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:47:32,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:47:24" (3/4) ... [2019-01-14 04:47:32,393 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:47:32,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:47:32,393 INFO L168 Benchmark]: Toolchain (without parser) took 9835.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -276.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:32,395 INFO L168 Benchmark]: CDTParser took 0.16 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-14 04:47:32,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.69 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 933.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:32,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:32,399 INFO L168 Benchmark]: Boogie Preprocessor took 49.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:32,399 INFO L168 Benchmark]: RCFGBuilder took 1219.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:47:32,400 INFO L168 Benchmark]: BuchiAutomizer took 7967.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:47:32,401 INFO L168 Benchmark]: Witness Printer took 6.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:47:32,406 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.16 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 445.69 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 933.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1219.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7967.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 114 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 516 SDtfs, 161 SDslu, 956 SDs, 0 SdLazy, 22 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax120 hnf105 lsp16 ukn100 mio100 lsp100 div106 bol100 ite100 ukn100 eq215 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...