./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label44_false-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 eb2ed652d9060283eed99b129e3cfec21e515617 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-14 03:07:07,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:07:07,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:07:07,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:07:07,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:07:07,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:07:07,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:07:07,428 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:07:07,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:07:07,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:07:07,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:07:07,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:07:07,433 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:07:07,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:07:07,441 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:07:07,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:07:07,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:07:07,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:07:07,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:07:07,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:07:07,453 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:07:07,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:07:07,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:07:07,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:07:07,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:07:07,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:07:07,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:07:07,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:07:07,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:07:07,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:07:07,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:07:07,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:07:07,470 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:07:07,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:07:07,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:07:07,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:07:07,476 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:07:07,510 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:07:07,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:07:07,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:07:07,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:07:07,512 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:07:07,512 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:07:07,513 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:07:07,514 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:07:07,514 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:07:07,515 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:07:07,515 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:07:07,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:07:07,515 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:07:07,515 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:07:07,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:07:07,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:07:07,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:07:07,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:07:07,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:07:07,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:07:07,517 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:07:07,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:07:07,521 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:07:07,521 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:07:07,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:07:07,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:07:07,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:07:07,522 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:07:07,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:07:07,523 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:07:07,523 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:07:07,525 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:07:07,525 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 -> eb2ed652d9060283eed99b129e3cfec21e515617 [2019-01-14 03:07:07,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:07:07,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:07:07,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:07:07,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:07:07,610 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:07:07,611 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2019-01-14 03:07:07,667 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7d77504/ab6041d1a0014d018ccc45512fd78981/FLAGa6b43c514 [2019-01-14 03:07:08,233 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:07:08,234 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2019-01-14 03:07:08,249 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7d77504/ab6041d1a0014d018ccc45512fd78981/FLAGa6b43c514 [2019-01-14 03:07:08,511 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7d77504/ab6041d1a0014d018ccc45512fd78981 [2019-01-14 03:07:08,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:07:08,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:07:08,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:07:08,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:07:08,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:07:08,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:08" (1/1) ... [2019-01-14 03:07:08,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b00c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:08, skipping insertion in model container [2019-01-14 03:07:08,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:08" (1/1) ... [2019-01-14 03:07:08,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:07:08,594 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:07:09,005 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:07:09,011 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:07:09,146 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:07:09,164 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:07:09,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09 WrapperNode [2019-01-14 03:07:09,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:07:09,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:07:09,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:07:09,166 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:07:09,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:07:09,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:07:09,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:07:09,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:07:09,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... [2019-01-14 03:07:09,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:07:09,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:07:09,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:07:09,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:07:09,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:07:09,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:07:12,617 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:07:12,617 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 03:07:12,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:12 BoogieIcfgContainer [2019-01-14 03:07:12,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:07:12,621 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:07:12,621 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:07:12,624 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:07:12,625 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:12,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:07:08" (1/3) ... [2019-01-14 03:07:12,626 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ccfe07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:07:12, skipping insertion in model container [2019-01-14 03:07:12,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:12,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:09" (2/3) ... [2019-01-14 03:07:12,627 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ccfe07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:07:12, skipping insertion in model container [2019-01-14 03:07:12,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:12,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:12" (3/3) ... [2019-01-14 03:07:12,630 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label44_false-unreach-call_false-termination.c [2019-01-14 03:07:12,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:07:12,684 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:07:12,684 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:07:12,685 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:07:12,685 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:07:12,685 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:07:12,685 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:07:12,685 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:07:12,686 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:07:12,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:07:12,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:07:12,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:12,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:12,761 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:12,762 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:07:12,762 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:07:12,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:07:12,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:07:12,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:12,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:12,776 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:12,776 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:07:12,785 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 [2019-01-14 03:07:12,785 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 [2019-01-14 03:07:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:07:12,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:12,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:12,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-01-14 03:07:12,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:12,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:12,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-01-14 03:07:12,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:12,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:13,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:13,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:07:13,557 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-14 03:07:13,698 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 03:07:13,709 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:13,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:13,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:13,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:13,711 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:13,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:13,712 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:13,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:13,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:07:13,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:13,713 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:13,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:13,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:13,919 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-14 03:07:13,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:13,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:13,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:13,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:13,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:13,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:14,234 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 03:07:14,485 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:07:14,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:14,568 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:14,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:14,584 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:14,584 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 [2019-01-14 03:07:14,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:14,622 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:14,622 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) [2019-01-14 03:07:14,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,659 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:14,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:14,678 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:14,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:14,815 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:14,816 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:14,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:14,854 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:14,854 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 [2019-01-14 03:07:14,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,875 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:14,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:14,878 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:14,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:14,905 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:14,905 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 [2019-01-14 03:07:14,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:14,928 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 [2019-01-14 03:07:14,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:14,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:15,008 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:07:15,015 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:15,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:15,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:15,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:15,016 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:07:15,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:15,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:15,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:15,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:07:15,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:15,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:15,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:15,522 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 03:07:15,693 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:07:16,059 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 03:07:16,061 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:16,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:07:16,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 [2019-01-14 03:07:16,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:16,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:16,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,095 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:16,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:16,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:16,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:16,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:16,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:16,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,205 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:16,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:16,208 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,226 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:07:16,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,229 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,231 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,258 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,264 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,274 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:16,274 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,277 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:07:16,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,309 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,309 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,323 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,325 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,329 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,330 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,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 [2019-01-14 03:07:16,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,343 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:16,343 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:16,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,351 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:07:16,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 [2019-01-14 03:07:16,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,354 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,357 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,383 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:16,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,387 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:16,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,425 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,426 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,433 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,433 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,445 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:16,445 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,448 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:16,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,455 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:07:16,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,457 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,460 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,471 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,471 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,480 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:16,480 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,483 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:07:16,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,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 [2019-01-14 03:07:16,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,503 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,505 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,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 [2019-01-14 03:07:16,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,512 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,513 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,520 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,521 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,528 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,531 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:16,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,534 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:16,534 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,537 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:16,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,543 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:07:16,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,545 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,546 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,547 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,550 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,568 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,569 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,569 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,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 [2019-01-14 03:07:16,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,579 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:16,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,584 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:07:16,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,621 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,621 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,622 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,625 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,633 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,642 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,643 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,643 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,650 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,651 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,651 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:16,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,659 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,659 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:16,659 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:16,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:16,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,670 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:07:16,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,671 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,672 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,676 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,693 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,697 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,704 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,704 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:16,704 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,711 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:16,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,754 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,754 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,755 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,767 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,767 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,772 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,779 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,783 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,789 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,789 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,790 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:16,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,797 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:16,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,798 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:16,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:16,802 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:16,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,813 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:07:16,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,814 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,821 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,838 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,839 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,843 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,851 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,854 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:16,854 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,861 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:07:16,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,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 [2019-01-14 03:07:16,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,922 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,927 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,944 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,944 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,959 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,967 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,967 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,968 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:16,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,974 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:16,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:16,975 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:16,980 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:16,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:16,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:16,994 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:07:16,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:16,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:16,996 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:16,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:16,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:16,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:16,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,001 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:17,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,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 [2019-01-14 03:07:17,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:17,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,018 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,019 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:17,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,025 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:17,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,026 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:17,026 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,030 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:17,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,060 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:17,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,061 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,061 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:17,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,071 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:17,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,072 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:17,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,075 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:17,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,076 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,076 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:17,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,080 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:17,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:17,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,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 [2019-01-14 03:07:17,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:17,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,083 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:17,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:17,084 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:17,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,092 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:07:17,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,094 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:17,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,132 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,133 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:17,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,138 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,138 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:17,139 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,142 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-14 03:07:17,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,262 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,263 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:17,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,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 [2019-01-14 03:07:17,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,277 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,277 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:17,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,283 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,283 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:17,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,289 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:17,289 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:17,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:17,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:17,295 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:17,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:17,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:17,295 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:17,295 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:17,297 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:17,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:17,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:17,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:17,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:17,335 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-01-14 03:07:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:19,259 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2019-01-14 03:07:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:19,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2019-01-14 03:07:19,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-14 03:07:19,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2019-01-14 03:07:19,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2019-01-14 03:07:19,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2019-01-14 03:07:19,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2019-01-14 03:07:19,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:19,293 INFO L706 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-14 03:07:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2019-01-14 03:07:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-14 03:07:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 03:07:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-01-14 03:07:19,344 INFO L729 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:07:19,344 INFO L609 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:07:19,344 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:07:19,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-01-14 03:07:19,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-01-14 03:07:19,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:19,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:19,348 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:19,348 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:19,349 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 [2019-01-14 03:07:19,349 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 [2019-01-14 03:07:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 03:07:19,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:19,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-01-14 03:07:19,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:19,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:19,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:19,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:19,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-01-14 03:07:19,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:19,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:19,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:19,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:07:19,844 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-01-14 03:07:19,886 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:19,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:19,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:19,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:19,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:19,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:19,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:19,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:19,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:07:19,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:19,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:19,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:19,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:19,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:19,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:19,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:19,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:20,328 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 [2019-01-14 03:07:20,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:20,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:20,338 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:20,338 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 [2019-01-14 03:07:20,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:20,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:20,363 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:20,363 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 [2019-01-14 03:07:20,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:20,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:20,388 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:20,388 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 [2019-01-14 03:07:20,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:20,410 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:20,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:20,412 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 [2019-01-14 03:07:20,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:20,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:20,445 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:20,446 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 [2019-01-14 03:07:20,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:20,539 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 [2019-01-14 03:07:20,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:20,563 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:20,616 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:07:20,620 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:20,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:20,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:20,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:20,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:07:20,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:20,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:20,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:20,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:07:20,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:20,623 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:20,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:20,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:21,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:21,077 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:07:21,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:21,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,081 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,081 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,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 [2019-01-14 03:07:21,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:21,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:21,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,087 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,090 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,091 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:21,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:21,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:21,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,099 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:07:21,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,100 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,101 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,103 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,103 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,105 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,105 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,107 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,107 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,109 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,113 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,113 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,119 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,125 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:07:21,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,130 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,130 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,132 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,134 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,135 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,137 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,138 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,138 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,142 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,142 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,143 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,149 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,154 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,154 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,157 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:07:21,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,158 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,158 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,161 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,161 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,162 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:21,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,163 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,163 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,166 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,168 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,168 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,169 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:21,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,173 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,173 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,174 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:21,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,181 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,182 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:21,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,187 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,187 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,190 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:07:21,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,191 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,191 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,194 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,195 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,195 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,197 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,197 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,198 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,202 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,203 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,203 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,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 [2019-01-14 03:07:21,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,210 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,210 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,222 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,222 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,223 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,243 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,243 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,244 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,263 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:21,264 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:21,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,270 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:07:21,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,271 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,274 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,275 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,284 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,284 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,285 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,285 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,288 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,288 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,289 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,296 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,296 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,297 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,307 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,307 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,307 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,307 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,309 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,328 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,329 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,329 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,331 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,356 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,356 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,359 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,374 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,374 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:21,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,377 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,389 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:07:21,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,390 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,391 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,393 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,406 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,406 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,406 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,413 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:21,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,415 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,416 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,416 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,422 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,423 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,424 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,435 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,435 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,437 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:21,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,462 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,463 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,463 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,471 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:21,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,514 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,514 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,516 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,540 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,541 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:21,547 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:21,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,560 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:07:21,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,561 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,572 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,572 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,572 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,579 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,584 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,584 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,585 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,591 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,592 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,592 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,592 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,605 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,608 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,609 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:21,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,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 [2019-01-14 03:07:21,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,623 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,623 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,624 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:21,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:21,646 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:21,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,654 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:07:21,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,655 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,656 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,667 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,667 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,668 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:21,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,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 [2019-01-14 03:07:21,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,674 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,675 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,686 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,686 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,696 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,697 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,697 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,697 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,698 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:21,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,722 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:21,722 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,724 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:21,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,753 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,753 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:21,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:21,799 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:21,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:21,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:21,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:21,799 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:21,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:21,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:21,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:21,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:21,817 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-01-14 03:07:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:23,063 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-01-14 03:07:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:23,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-01-14 03:07:23,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:07:23,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:07:23,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-01-14 03:07:23,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-01-14 03:07:23,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-01-14 03:07:23,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:23,082 INFO L706 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-01-14 03:07:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-14 03:07:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-14 03:07:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:07:23,113 INFO L729 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:23,114 INFO L609 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:23,114 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:07:23,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-01-14 03:07:23,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:07:23,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:23,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:23,122 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:23,122 INFO L868 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] [2019-01-14 03:07:23,122 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 [2019-01-14 03:07:23,124 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 [2019-01-14 03:07:23,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 03:07:23,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:23,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:23,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:23,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2019-01-14 03:07:23,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:23,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:23,393 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-14 03:07:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:23,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:23,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:07:23,478 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:07:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:07:23,478 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-01-14 03:07:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:25,112 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2019-01-14 03:07:25,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:07:25,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:25,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2019-01-14 03:07:25,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2019-01-14 03:07:25,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2019-01-14 03:07:25,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2019-01-14 03:07:25,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:25,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:25,138 INFO L706 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2019-01-14 03:07:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2019-01-14 03:07:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-14 03:07:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2019-01-14 03:07:25,170 INFO L729 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:07:25,170 INFO L609 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:07:25,170 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:07:25,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2019-01-14 03:07:25,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2019-01-14 03:07:25,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:25,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:25,180 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:25,180 INFO L868 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] [2019-01-14 03:07:25,181 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 [2019-01-14 03:07:25,181 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 [2019-01-14 03:07:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-14 03:07:25,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:25,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:25,189 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-01-14 03:07:25,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:25,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:25,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:07:25,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:25,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:25,259 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:25,260 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2019-01-14 03:07:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:26,133 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2019-01-14 03:07:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:26,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:26,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:26,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:07:26,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-01-14 03:07:26,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-01-14 03:07:26,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:26,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:26,163 INFO L706 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2019-01-14 03:07:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-14 03:07:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:07:26,190 INFO L729 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:26,190 INFO L609 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:26,190 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:07:26,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:26,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:26,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:26,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:26,205 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:26,207 INFO L868 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] [2019-01-14 03:07:26,207 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 [2019-01-14 03:07:26,208 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 [2019-01-14 03:07:26,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:26,208 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-14 03:07:26,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:26,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2019-01-14 03:07:26,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:26,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:26,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:26,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:07:26,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:26,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:26,354 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:26,355 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2019-01-14 03:07:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:27,479 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2019-01-14 03:07:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:27,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:27,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:27,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:07:27,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2019-01-14 03:07:27,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2019-01-14 03:07:27,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:27,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:27,502 INFO L706 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-01-14 03:07:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-01-14 03:07:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:07:27,522 INFO L729 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:27,522 INFO L609 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:27,522 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:07:27,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:27,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:27,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:27,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:27,530 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:27,531 INFO L868 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] [2019-01-14 03:07:27,531 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 [2019-01-14 03:07:27,531 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 [2019-01-14 03:07:27,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-01-14 03:07:27,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:27,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:27,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2019-01-14 03:07:27,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:27,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:27,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:27,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:27,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:27,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:27,782 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:27,784 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2019-01-14 03:07:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:28,117 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2019-01-14 03:07:28,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:28,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:28,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:07:28,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:07:28,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-14 03:07:28,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-14 03:07:28,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:28,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:28,145 INFO L706 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-14 03:07:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-14 03:07:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:07:28,170 INFO L729 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:28,170 INFO L609 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:28,170 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:07:28,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:28,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:07:28,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:28,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:28,179 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:28,179 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-01-14 03:07:28,180 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 [2019-01-14 03:07:28,188 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 [2019-01-14 03:07:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-01-14 03:07:28,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:28,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:28,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-01-14 03:07:28,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:28,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:28,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:28,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-01-14 03:07:28,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:28,585 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 03:07:28,930 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 03:07:29,253 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-14 03:07:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:29,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:29,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 03:07:31,326 WARN L181 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-01-14 03:07:31,467 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 03:07:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 03:07:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 03:07:31,473 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2019-01-14 03:07:32,216 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-14 03:07:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:32,768 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2019-01-14 03:07:32,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 03:07:32,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2019-01-14 03:07:32,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:07:32,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2019-01-14 03:07:32,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2019-01-14 03:07:32,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2019-01-14 03:07:32,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:32,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:32,797 INFO L706 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2019-01-14 03:07:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-01-14 03:07:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2019-01-14 03:07:32,816 INFO L729 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:32,816 INFO L609 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:32,816 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:07:32,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:32,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:07:32,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:32,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:32,823 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:07:32,823 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:32,824 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 [2019-01-14 03:07:32,824 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 [2019-01-14 03:07:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:32,824 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-01-14 03:07:32,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:32,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:32,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:32,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:32,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-01-14 03:07:32,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:32,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-01-14 03:07:32,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:32,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:32,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:33,138 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-01-14 03:07:33,296 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-14 03:07:33,346 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:33,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:33,347 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:33,347 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:33,347 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:33,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:33,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:33,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:33,348 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration8_Lasso [2019-01-14 03:07:33,348 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:33,348 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:33,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:33,759 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:33,759 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 [2019-01-14 03:07:33,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,769 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 [2019-01-14 03:07:33,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,793 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 [2019-01-14 03:07:33,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,821 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,821 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 [2019-01-14 03:07:33,844 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,844 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,847 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 [2019-01-14 03:07:33,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,887 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,893 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,893 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 [2019-01-14 03:07:33,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,919 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,919 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} 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 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 [2019-01-14 03:07:33,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,941 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,944 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,944 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 [2019-01-14 03:07:33,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,969 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 [2019-01-14 03:07:33,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:33,991 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:33,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:33,994 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 [2019-01-14 03:07:34,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,017 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,017 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 [2019-01-14 03:07:34,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,041 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 [2019-01-14 03:07:34,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,064 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:34,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,095 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 [2019-01-14 03:07:34,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,116 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,119 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,119 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 [2019-01-14 03:07:34,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,144 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,144 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 [2019-01-14 03:07:34,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,165 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 [2019-01-14 03:07:34,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:34,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,407 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 [2019-01-14 03:07:34,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,431 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,431 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 [2019-01-14 03:07:34,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,451 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,454 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 [2019-01-14 03:07:34,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,475 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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:34,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:34,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,671 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 [2019-01-14 03:07:34,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,694 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 [2019-01-14 03:07:34,715 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:34,715 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:34,726 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:34,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-14 03:07:34,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:07:34 BoogieIcfgContainer [2019-01-14 03:07:34,777 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:07:34,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:07:34,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:07:34,781 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:07:34,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:12" (3/4) ... [2019-01-14 03:07:34,787 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 03:07:34,847 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 03:07:34,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:07:34,848 INFO L168 Benchmark]: Toolchain (without parser) took 26333.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 431.0 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -307.5 MB). Peak memory consumption was 123.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:34,849 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:07:34,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.13 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:34,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -208.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:34,850 INFO L168 Benchmark]: Boogie Preprocessor took 97.84 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:34,851 INFO L168 Benchmark]: RCFGBuilder took 3182.76 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: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:34,851 INFO L168 Benchmark]: BuchiAutomizer took 22155.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -238.6 MB). Peak memory consumption was 481.9 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:34,852 INFO L168 Benchmark]: Witness Printer took 69.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:07:34,856 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.13 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 172.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -208.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.84 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.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3182.76 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: 99.1 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22155.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -238.6 MB). Peak memory consumption was 481.9 MB. Max. memory is 11.5 GB. * Witness Printer took 69.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 22.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 13.0s. Construction of modules took 6.7s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s 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, 6.7s 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: 123ms 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@7b92393b=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@563e14ff=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@7b92393b=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@563e14ff=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@7b92393b=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@563e14ff=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...