./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label27_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/eca-rers2012/Problem02_label27_true-unreach-call_false-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 571733b9b2b4edd3beb90cbc1a974d2015477291 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:32:22,616 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:32:22,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:32:22,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:32:22,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:32:22,633 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:32:22,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:32:22,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:32:22,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:32:22,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:32:22,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:32:22,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:32:22,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:32:22,643 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:32:22,644 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:32:22,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:32:22,646 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:32:22,648 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:32:22,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:32:22,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:32:22,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:32:22,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:32:22,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:32:22,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:32:22,658 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:32:22,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:32:22,660 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:32:22,661 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:32:22,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:32:22,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:32:22,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:32:22,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:32:22,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:32:22,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:32:22,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:32:22,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:32:22,666 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:32:22,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:32:22,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:32:22,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:32:22,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:32:22,686 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:32:22,686 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:32:22,686 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:32:22,687 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:32:22,687 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:32:22,687 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:32:22,687 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:32:22,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:32:22,687 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:32:22,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:32:22,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:32:22,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:32:22,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:32:22,688 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:32:22,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:32:22,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:32:22,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:32:22,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:32:22,691 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:32:22,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:32:22,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:32:22,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:32:22,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:32:22,692 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:32:22,693 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:32:22,693 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:32:22,693 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:32:22,694 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:32:22,695 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 -> 571733b9b2b4edd3beb90cbc1a974d2015477291 [2018-11-28 23:32:22,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:32:22,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:32:22,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:32:22,756 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:32:22,757 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:32:22,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label27_true-unreach-call_false-termination.c [2018-11-28 23:32:22,830 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f659931/d9680e8679ff4df3a99d4bab264a5243/FLAG02bd281bd [2018-11-28 23:32:23,369 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:32:23,370 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label27_true-unreach-call_false-termination.c [2018-11-28 23:32:23,384 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f659931/d9680e8679ff4df3a99d4bab264a5243/FLAG02bd281bd [2018-11-28 23:32:23,626 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f659931/d9680e8679ff4df3a99d4bab264a5243 [2018-11-28 23:32:23,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:32:23,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:32:23,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:32:23,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:32:23,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:32:23,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:32:23" (1/1) ... [2018-11-28 23:32:23,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef72e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:23, skipping insertion in model container [2018-11-28 23:32:23,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:32:23" (1/1) ... [2018-11-28 23:32:23,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:32:23,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:32:24,269 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:32:24,277 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:32:24,391 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:32:24,420 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:32:24,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24 WrapperNode [2018-11-28 23:32:24,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:32:24,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:32:24,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:32:24,421 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:32:24,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:32:24,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:32:24,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:32:24,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:32:24,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (1/1) ... [2018-11-28 23:32:24,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:32:24,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:32:24,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:32:24,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:32:24,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (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 [2018-11-28 23:32:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:32:24,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:32:28,391 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:32:28,392 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:32:28,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:28 BoogieIcfgContainer [2018-11-28 23:32:28,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:32:28,393 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:32:28,394 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:32:28,398 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:32:28,399 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:32:28,400 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:32:23" (1/3) ... [2018-11-28 23:32:28,401 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d10c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:32:28, skipping insertion in model container [2018-11-28 23:32:28,402 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:32:28,402 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:24" (2/3) ... [2018-11-28 23:32:28,402 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18d10c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:32:28, skipping insertion in model container [2018-11-28 23:32:28,402 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:32:28,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:28" (3/3) ... [2018-11-28 23:32:28,406 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label27_true-unreach-call_false-termination.c [2018-11-28 23:32:28,468 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:32:28,469 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:32:28,470 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:32:28,470 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:32:28,470 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:32:28,470 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:32:28,470 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:32:28,470 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:32:28,471 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:32:28,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 23:32:28,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 23:32:28,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:28,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:28,552 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:28,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:32:28,553 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:32:28,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 23:32:28,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 23:32:28,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:28,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:28,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:28,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:32:28,577 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-11-28 23:32:28,578 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-11-28 23:32:28,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:32:28,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:28,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:28,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-28 23:32:28,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:28,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:28,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:28,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:28,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-28 23:32:28,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:28,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:28,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:28,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:28,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:32:29,571 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-28 23:32:29,692 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 23:32:29,720 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:29,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:29,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:29,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:29,724 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:32:29,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:29,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:29,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:29,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 23:32:29,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:29,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:29,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:29,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:30,135 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-28 23:32:30,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:30,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:30,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:30,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:30,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:30,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:30,655 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-28 23:32:30,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:30,758 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 [2018-11-28 23:32:30,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:30,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:30,775 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:30,776 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:32:30,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:30,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:30,812 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:30,812 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:30,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:30,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:30,851 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:30,851 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:30,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:30,899 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:30,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:30,914 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:30,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:30,956 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:30,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:30,970 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:31,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:31,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:31,052 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:31,052 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:31,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:31,090 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:31,102 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:31,102 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:31,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:31,130 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:31,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:31,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:31,190 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:32:31,192 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:31,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:31,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:31,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:31,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:32:31,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:31,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:31,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:31,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 23:32:31,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:31,194 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:31,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:31,857 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-28 23:32:32,289 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 23:32:32,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:32,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:32:32,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:32,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:32,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,341 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:32,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:32,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:32,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:32,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:32,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:32,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,416 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:32,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:32,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,423 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 23:32:32,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,425 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,426 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,438 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,439 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,444 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:32,444 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,447 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 23:32:32,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,495 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,499 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,515 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,560 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,560 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,568 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,568 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,571 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:32,571 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:32,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,578 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 23:32:32,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,584 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,610 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,623 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:32,623 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,629 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:32,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,664 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,684 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,684 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,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 [2018-11-28 23:32:32,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,698 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:32,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,699 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:32,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,709 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 23:32:32,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,713 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,715 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:32,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,734 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,737 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:32,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,748 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:32,748 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,752 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 23:32:32,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,781 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,782 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:32,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,788 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,788 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:32,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,793 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:32,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,800 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:32,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:32,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,804 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:32,804 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:32,807 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:32,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,814 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 23:32:32,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,818 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,818 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,819 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,822 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,843 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,844 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,844 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,855 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,855 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:32,855 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,859 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 23:32:32,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,902 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,902 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,903 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,914 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,918 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,918 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,929 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,929 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,937 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,938 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:32,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,940 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:32,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,941 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:32,942 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:32,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:32,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,951 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 23:32:32,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,952 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,953 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:32,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,956 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,980 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:32,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:32,981 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:32,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:32,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:32,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:32,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:32,989 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:32,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:32,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:32,989 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:32,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:32,993 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:32,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,043 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:33,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,045 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,052 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:33,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,054 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,059 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:33,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,059 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,066 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:33,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,069 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:33,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,070 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:33,070 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,071 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:33,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,082 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 23:32:33,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,083 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,084 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,087 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:33,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,103 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,104 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,105 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:33,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,113 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,113 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:33,114 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,119 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 23:32:33,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,175 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,175 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,177 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:33,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,188 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,188 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,189 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:33,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,197 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,197 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,198 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:33,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,206 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,206 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,207 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:33,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,209 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,210 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:33,210 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:33,212 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:33,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,227 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 23:32:33,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,228 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,229 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,230 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,245 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,245 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,245 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,246 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,250 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,250 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:33,250 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,252 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:33,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,277 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,278 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,285 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,286 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,289 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,290 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,291 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,294 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,295 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,295 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:33,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,298 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,298 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:33,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,299 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:33,299 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:33,300 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:33,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,308 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 23:32:33,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,309 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,310 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:33,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,352 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,352 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:33,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,358 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,359 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:33,359 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,362 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 23:32:33,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,474 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,475 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:33,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,488 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,489 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:33,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,495 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,495 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:33,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,501 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:33,501 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:33,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:33,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:33,506 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:33,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:33,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:33,507 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:33,507 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:33,508 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:33,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:33,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:33,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:33,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:33,543 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-28 23:32:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:35,477 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-11-28 23:32:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:35,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-11-28 23:32:35,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 23:32:35,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-11-28 23:32:35,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-11-28 23:32:35,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-11-28 23:32:35,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-11-28 23:32:35,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:35,522 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-11-28 23:32:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-11-28 23:32:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-11-28 23:32:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-28 23:32:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-11-28 23:32:35,583 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 23:32:35,583 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 23:32:35,583 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:32:35,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-11-28 23:32:35,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-11-28 23:32:35,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:35,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:35,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:35,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:32:35,589 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-11-28 23:32:35,589 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-11-28 23:32:35,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:32:35,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:35,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:35,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:35,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-28 23:32:35,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:35,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:35,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:35,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:35,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-28 23:32:35,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:35,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:35,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:35,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:35,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:35,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:32:35,905 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-28 23:32:35,978 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:35,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:35,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:35,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:35,979 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:32:35,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:35,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:35,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:35,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 23:32:35,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:35,980 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:35,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:35,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:35,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:36,403 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:36,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:36,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:36,412 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:36,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:36,443 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:36,443 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:36,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:36,467 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:36,467 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:36,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:36,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:36,498 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,522 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:36,522 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:36,539 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:36,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:36,561 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:36,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:36,698 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:32:36,700 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:36,700 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:36,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:36,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:36,700 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:32:36,700 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:36,701 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:36,701 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:36,701 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 23:32:36,701 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:36,701 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:36,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:36,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:37,176 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 23:32:37,365 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:37,365 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:32:37,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:37,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,377 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:37,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:37,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,392 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,399 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:37,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:37,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:37,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,417 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 23:32:37,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,423 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,425 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,425 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:37,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,432 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,432 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,437 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,437 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,444 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,444 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:37,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,459 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,459 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:37,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,466 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,467 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,471 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,473 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 23:32:37,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,474 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,475 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,478 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,480 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,480 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,483 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,483 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,485 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,485 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,486 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,491 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,492 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,510 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,511 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,521 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,528 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 23:32:37,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,529 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,529 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,539 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,539 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,540 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:37,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,545 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,545 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,549 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,549 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,555 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,555 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,556 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:37,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,566 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,567 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:37,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,583 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,584 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:37,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,592 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,596 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,602 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 23:32:37,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,606 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,607 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,613 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,614 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,614 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:37,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,618 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,618 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,618 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,622 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,623 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,623 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,629 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,629 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,629 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:37,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,641 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,641 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:37,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,658 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,663 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,664 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,679 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,679 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:37,680 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:37,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,687 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 23:32:37,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,691 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,701 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,702 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,707 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,710 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,716 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,716 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,717 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,726 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,726 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,726 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,731 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,746 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,747 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,747 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,748 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,761 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,762 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,770 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:37,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,775 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 23:32:37,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,776 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,781 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,792 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,792 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,797 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:37,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,802 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,802 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,803 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,808 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,808 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,808 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,809 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,814 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,815 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,815 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,817 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:37,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,827 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,828 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,830 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:37,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,853 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,853 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,855 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,875 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,876 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:37,878 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:37,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,891 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 23:32:37,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,899 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,900 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,909 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,910 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,910 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,924 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,924 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,925 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,925 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,936 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,937 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,937 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:37,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,956 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,956 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,960 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,973 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:37,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:37,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:37,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,984 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 23:32:37,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,984 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:37,985 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:37,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:37,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:37,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:37,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:37,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:37,994 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:37,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:37,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:37,994 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:37,994 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:37,998 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:37,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:38,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:38,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:38,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:38,001 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:38,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:38,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:38,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:38,002 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:38,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:38,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:38,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:38,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:38,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:38,014 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:38,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:38,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:38,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:38,015 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:38,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:38,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:38,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:38,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:38,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:38,025 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:38,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:38,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:38,025 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:38,025 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:38,026 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:38,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:38,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:38,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:38,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:38,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:38,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:38,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:38,062 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:38,062 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:38,068 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:38,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:38,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:38,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:38,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:38,113 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:38,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:38,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:38,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:38,114 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:38,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:38,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:38,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:38,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:38,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:38,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:38,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:38,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:38,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:38,155 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:38,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:38,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:38,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:38,167 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-11-28 23:32:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:39,642 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-11-28 23:32:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:39,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-11-28 23:32:39,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 23:32:39,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 23:32:39,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-11-28 23:32:39,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-11-28 23:32:39,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-11-28 23:32:39,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:39,670 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 23:32:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-11-28 23:32:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-11-28 23:32:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-28 23:32:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 23:32:39,714 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 23:32:39,714 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 23:32:39,715 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:32:39,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-11-28 23:32:39,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 23:32:39,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:39,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:39,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:39,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:32:39,724 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-11-28 23:32:39,733 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-11-28 23:32:39,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 23:32:39,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:39,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:39,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:39,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:39,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:39,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-28 23:32:39,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:39,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:39,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:40,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:40,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:32:40,085 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:32:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:32:40,087 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-11-28 23:32:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:41,822 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-11-28 23:32:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:32:41,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-11-28 23:32:41,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-11-28 23:32:41,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-11-28 23:32:41,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-11-28 23:32:41,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-11-28 23:32:41,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-11-28 23:32:41,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:41,846 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-11-28 23:32:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-11-28 23:32:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-11-28 23:32:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-11-28 23:32:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-11-28 23:32:41,871 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 23:32:41,872 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 23:32:41,872 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:32:41,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-11-28 23:32:41,879 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-11-28 23:32:41,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:41,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:41,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:41,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:32:41,882 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-11-28 23:32:41,882 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-11-28 23:32:41,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:41,883 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-28 23:32:41,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:41,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:41,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:41,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:41,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:41,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-28 23:32:41,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:41,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:41,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:32:42,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:42,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:32:42,017 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:42,018 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-11-28 23:32:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:42,904 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-11-28 23:32:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:42,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:42,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:42,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 23:32:42,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-11-28 23:32:42,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-11-28 23:32:42,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:42,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:42,934 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 23:32:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-11-28 23:32:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-11-28 23:32:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 23:32:42,963 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 23:32:42,963 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 23:32:42,963 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:32:42,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:42,974 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:42,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:42,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:42,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:42,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-28 23:32:42,982 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-11-28 23:32:42,983 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-11-28 23:32:42,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-28 23:32:42,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:42,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:42,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:43,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-28 23:32:43,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:43,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:43,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:32:43,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:43,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:32:43,115 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:43,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:43,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:43,115 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-11-28 23:32:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:44,292 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-11-28 23:32:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:44,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:44,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:44,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 23:32:44,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-11-28 23:32:44,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-11-28 23:32:44,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:44,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:44,320 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 23:32:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-11-28 23:32:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-11-28 23:32:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 23:32:44,342 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 23:32:44,342 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 23:32:44,342 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:32:44,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:44,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:44,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:44,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:44,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:44,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:32:44,358 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-11-28 23:32:44,360 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-11-28 23:32:44,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:44,361 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-28 23:32:44,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:44,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:44,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:44,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:44,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-28 23:32:44,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:44,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:44,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:44,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:44,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:32:44,628 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:44,629 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-11-28 23:32:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:44,950 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-11-28 23:32:44,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:44,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:44,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 23:32:44,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 23:32:44,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-11-28 23:32:44,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-11-28 23:32:44,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:44,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:44,970 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 23:32:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-11-28 23:32:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-11-28 23:32:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 23:32:44,990 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 23:32:44,990 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 23:32:44,990 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:32:44,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:44,996 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 23:32:44,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:44,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:44,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:44,997 INFO L867 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, 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, 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, 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, 1, 1, 1, 1, 1] [2018-11-28 23:32:44,998 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-11-28 23:32:45,002 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-11-28 23:32:45,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-28 23:32:45,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:45,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:45,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-28 23:32:45,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:45,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:45,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-28 23:32:45,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:45,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:45,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:45,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:45,389 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:32:45,707 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:32:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:46,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:46,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 23:32:48,530 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-28 23:32:48,671 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-28 23:32:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:32:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:32:48,675 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-11-28 23:32:49,906 WARN L180 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-28 23:32:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:50,525 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-11-28 23:32:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:32:50,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-11-28 23:32:50,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 23:32:50,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-11-28 23:32:50,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-11-28 23:32:50,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-11-28 23:32:50,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-11-28 23:32:50,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:50,553 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 23:32:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-11-28 23:32:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-11-28 23:32:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-11-28 23:32:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-11-28 23:32:50,576 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 23:32:50,576 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 23:32:50,576 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:32:50,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-11-28 23:32:50,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 23:32:50,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:50,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:50,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:32:50,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:32:50,590 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-11-28 23:32:50,593 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-11-28 23:32:50,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-28 23:32:50,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:50,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:50,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:50,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-28 23:32:50,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:50,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:50,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:50,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:50,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:50,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-28 23:32:50,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:50,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:50,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:50,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:50,788 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-11-28 23:32:50,958 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-28 23:32:51,023 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:51,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:51,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:51,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:51,024 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:32:51,024 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:51,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:51,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-28 23:32:51,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:51,024 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:51,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:51,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:51,460 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,472 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,494 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,497 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,497 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,523 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,553 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,556 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,556 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,578 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,582 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,582 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,611 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,611 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,664 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,688 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,689 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,715 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,741 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,741 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,768 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,793 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:51,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,814 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,818 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,818 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,843 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,843 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:51,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:51,868 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:51,892 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:51,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:51,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:52,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:52,156 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:52,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:52,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:52,182 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:52,182 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:52,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:52,202 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:52,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:52,205 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:52,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:52,227 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:52,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:52,250 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:52,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:52,423 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:52,444 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:52,444 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:52,447 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:52,447 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:52,471 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:52,471 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:52,475 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:52,475 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-28 23:32:52,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:32:52 BoogieIcfgContainer [2018-11-28 23:32:52,530 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:32:52,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:32:52,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:32:52,530 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:32:52,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:28" (3/4) ... [2018-11-28 23:32:52,540 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:32:52,600 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:32:52,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:32:52,601 INFO L168 Benchmark]: Toolchain (without parser) took 28971.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.2 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -312.8 MB). Peak memory consumption was 113.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:52,602 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:32:52,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.86 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 912.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:52,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 912.4 MB in the beginning and 1.1 GB in the end (delta: -208.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:52,609 INFO L168 Benchmark]: Boogie Preprocessor took 98.25 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:52,609 INFO L168 Benchmark]: RCFGBuilder took 3686.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.8 MB). Peak memory consumption was 98.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:52,610 INFO L168 Benchmark]: BuchiAutomizer took 24136.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -251.2 MB). Peak memory consumption was 487.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:52,613 INFO L168 Benchmark]: Witness Printer took 70.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:52,621 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 787.86 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 912.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 185.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 912.4 MB in the beginning and 1.1 GB in the end (delta: -208.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.25 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3686.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.8 MB). Peak memory consumption was 98.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24136.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -251.2 MB). Peak memory consumption was 487.1 MB. Max. memory is 11.5 GB. * Witness Printer took 70.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 14.0s. Construction of modules took 7.1s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 115ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30893fe8=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ab2d3c3=0, y=0, x=0, z=0, u=0, w=0, v=0, a=0, c=0, a28=0, \old(input)=0, output=0, a25=0, a21=0, d=0, e=0, f=0, input=0, input=0} State at position 1 is {a19=1, a17=8, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30893fe8=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ab2d3c3=1, y=25, x=24, z=26, u=21, w=23, v=22, a=1, c=3, a28=10, \old(input)=6, output=-1, a25=0, a21=1, d=4, e=5, f=6, input=6, input=6} For i>1, the state at position i is {a19=1 + sum_{k=0}^i 0, a17=8 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30893fe8=0 + sum_{k=0}^i 0, a11=0 + sum_{k=0}^i 0, \result=22 + sum_{k=0}^i -23*0^k, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ab2d3c3=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...