./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer --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 9fc45ae4ddf84075a39a55d475a45c859aa435e6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-5842f4b [2018-11-18 08:34:46,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:46,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:46,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:46,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:46,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:46,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:46,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:46,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:46,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:46,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:46,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:46,457 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:46,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:46,458 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:46,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:46,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:46,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:46,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:46,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:46,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:46,465 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:46,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:46,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:46,467 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:46,468 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:46,469 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:46,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:46,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:46,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:46,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:46,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:46,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:46,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:46,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:46,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:46,473 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 08:34:46,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:46,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:46,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:46,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:46,484 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:46,484 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:46,484 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:46,484 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:46,484 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:46,485 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:46,485 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:46,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:46,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:46,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:46,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:46,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:46,486 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:46,487 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:46,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:46,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:46,487 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:46,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:46,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:46,487 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:46,488 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:46,488 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer 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 -> 9fc45ae4ddf84075a39a55d475a45c859aa435e6 [2018-11-18 08:34:46,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:46,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:46,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:46,527 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:46,527 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:46,528 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-11-18 08:34:46,576 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/data/f33af2b62/8aeae50f8edb4fc4bd2912273b770b60/FLAG449249be9 [2018-11-18 08:34:46,958 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:46,958 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-11-18 08:34:46,968 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/data/f33af2b62/8aeae50f8edb4fc4bd2912273b770b60/FLAG449249be9 [2018-11-18 08:34:47,335 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/data/f33af2b62/8aeae50f8edb4fc4bd2912273b770b60 [2018-11-18 08:34:47,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:47,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:47,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:47,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:47,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:47,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcbd590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47, skipping insertion in model container [2018-11-18 08:34:47,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:47,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:47,601 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:47,604 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:47,671 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:47,683 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:47,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47 WrapperNode [2018-11-18 08:34:47,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:47,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:47,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:47,685 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:47,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:47,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:47,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:47,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:47,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... [2018-11-18 08:34:47,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:47,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:47,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:47,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:47,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 08:34:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:47,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:48,716 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:48,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:48 BoogieIcfgContainer [2018-11-18 08:34:48,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:48,717 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:48,717 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:48,720 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:48,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:48,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:47" (1/3) ... [2018-11-18 08:34:48,722 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b27dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:48, skipping insertion in model container [2018-11-18 08:34:48,722 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:48,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:47" (2/3) ... [2018-11-18 08:34:48,722 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b27dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:48, skipping insertion in model container [2018-11-18 08:34:48,722 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:48,722 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:48" (3/3) ... [2018-11-18 08:34:48,723 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label36_true-unreach-call_false-termination.c [2018-11-18 08:34:48,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:48,759 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:48,759 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:48,759 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:48,759 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:48,759 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:48,759 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:48,759 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:48,759 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:48,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 08:34:48,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 08:34:48,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:48,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:48,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:48,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 08:34:48,805 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:48,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 08:34:48,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 08:34:48,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:48,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:48,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:48,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 08:34:48,816 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~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 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-18 08:34:48,817 INFO L796 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true 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);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#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; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-18 08:34:48,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 08:34:48,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:48,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 08:34:48,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:48,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:48,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 08:34:48,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:48,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:48,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:48,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:48,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:48,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:34:49,130 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:49,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:49,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:49,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:49,131 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:49,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,132 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:49,132 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:49,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 08:34:49,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:49,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:49,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,357 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:49,358 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,386 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:49,387 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,421 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:49,421 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,456 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:49,457 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/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 [2018-11-18 08:34:49,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,487 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:49,488 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/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 [2018-11-18 08:34:49,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,544 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:49,544 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:49,563 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/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 [2018-11-18 08:34:49,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:49,608 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:49,633 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:49,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:49,684 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:49,688 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:49,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:49,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:49,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:49,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:49,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:49,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:49,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:49,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 08:34:49,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:49,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:49,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:49,928 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-18 08:34:49,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:49,949 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:49,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,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 [2018-11-18 08:34:49,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,967 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:49,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:49,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:49,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:49,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:49,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:49,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:49,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:49,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:49,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:49,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:49,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,001 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:50,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,007 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 08:34:50,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,009 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,010 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,018 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,018 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,022 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,022 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,024 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 08:34:50,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,040 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,040 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,045 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,046 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,049 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,050 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,053 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,054 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,055 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,056 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,061 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 08:34:50,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,063 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,079 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,081 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 08:34:50,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,120 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,128 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,131 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,131 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,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 [2018-11-18 08:34:50,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,133 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,134 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:50,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,142 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 08:34:50,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,144 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,145 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,155 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,155 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,160 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,160 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,161 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 08:34:50,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,174 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,174 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,181 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,182 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,184 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,185 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,188 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,188 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:50,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,190 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,190 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,190 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:50,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,195 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 08:34:50,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,196 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,198 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,210 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,211 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,214 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,214 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,214 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,216 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 08:34:50,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,239 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,240 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,244 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,245 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,246 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,249 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,249 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,250 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,255 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,256 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,256 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:50,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,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 [2018-11-18 08:34:50,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,258 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,258 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,258 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:50,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,264 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 08:34:50,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,265 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,265 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,267 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,278 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,279 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,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 [2018-11-18 08:34:50,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,282 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,282 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,285 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 08:34:50,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,308 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,309 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,310 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,314 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,314 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,314 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,315 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,319 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,320 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,320 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,324 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,324 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,324 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,325 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,327 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,327 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:50,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,328 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,328 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,329 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:50,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,335 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 08:34:50,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,336 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,337 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,339 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,347 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,347 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,348 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,353 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,354 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,354 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,357 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 08:34:50,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,387 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,387 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,388 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,397 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,397 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,398 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,403 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,403 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,403 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,404 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,409 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,409 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,410 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:50,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,412 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,412 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,412 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,412 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:50,414 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:50,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,422 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 08:34:50,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 [2018-11-18 08:34:50,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,423 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,423 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,432 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,432 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,433 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,436 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,436 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,438 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 08:34:50,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,452 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,452 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,453 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,458 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,458 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,461 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,461 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,461 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,461 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,464 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,464 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,465 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:50,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,467 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:50,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,467 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,467 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:50,468 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:50,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,474 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 08:34:50,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,475 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,475 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,475 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,498 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,499 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,503 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,503 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,503 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 08:34:50,503 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,506 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 08:34:50,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,560 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,561 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,570 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,570 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,574 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,575 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:50,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,579 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:50,579 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:50,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,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 [2018-11-18 08:34:50,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:50,583 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:50,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:50,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:50,584 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:50,584 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:50,585 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 08:34:50,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:50,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:50,606 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 08:34:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:51,150 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 08:34:51,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:51,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 08:34:51,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 08:34:51,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 08:34:51,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 08:34:51,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 08:34:51,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 08:34:51,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:51,168 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 08:34:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 08:34:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 08:34:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 08:34:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 08:34:51,201 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 08:34:51,201 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 08:34:51,201 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:51,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 08:34:51,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 08:34:51,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:51,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:51,204 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:51,204 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:51,204 INFO L794 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-18 08:34:51,204 INFO L796 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 991#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 734#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); 883#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 760#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); 694#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 695#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); 849#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 634#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; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-18 08:34:51,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 08:34:51,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:51,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 08:34:51,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:51,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 08:34:51,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:51,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:51,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:34:51,348 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:51,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:51,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:51,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:51,348 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:51,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:51,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:51,348 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 08:34:51,348 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:51,348 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:51,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,487 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:51,487 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:51,491 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:51,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:51,494 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:51,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:51,516 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:51,516 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:51,535 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:51,538 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:51,538 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:51,562 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:51,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:51,565 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:51,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:51,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:51,586 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:51,606 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:51,629 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:51,654 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 08:34:51,655 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:51,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:51,656 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:51,656 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:51,656 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:51,656 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:51,656 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:51,656 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:51,656 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 08:34:51,656 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:51,656 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:51,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:51,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:51,833 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:51,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,841 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,842 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,847 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,847 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,853 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:51,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:51,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,859 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 08:34:51,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,860 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,861 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,863 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,863 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,865 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,867 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,867 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,876 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,876 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,878 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,878 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,881 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,881 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,886 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,886 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,889 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 08:34:51,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,893 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,895 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,896 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:51,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,898 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,901 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,904 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:51,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,907 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,907 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:51,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,917 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,919 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 08:34:51,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,921 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,921 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,923 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,924 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,927 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,927 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:51,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,929 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,929 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,931 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,931 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,934 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,935 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:51,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,938 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,939 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,939 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:51,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:51,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,952 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:51,953 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:51,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,956 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 08:34:51,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,957 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,957 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,960 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,960 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,961 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,965 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,966 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,968 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,969 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,969 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,970 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,971 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,971 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,974 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,974 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,974 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,979 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,979 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:51,979 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:51,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:51,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 08:34:51,989 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 08:34:51,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,993 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 08:34:51,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,993 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,993 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:51,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,994 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:51,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:51,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:51,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:51,998 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:51,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:51,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:51,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:51,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:51,999 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:51,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,003 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:52,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,004 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,005 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:52,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,007 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:52,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,013 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:52,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,016 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,017 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:52,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,017 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,018 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:52,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,023 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:52,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,024 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,024 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,025 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:52,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,035 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 08:34:52,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,041 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 08:34:52,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,042 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,042 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,043 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:52,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,047 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,047 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:52,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,054 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,054 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,054 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,054 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,055 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:52,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,057 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,057 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,058 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:52,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,059 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,060 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,060 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:52,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,064 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,064 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,066 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:52,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,074 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,074 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,074 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,077 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 08:34:52,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,091 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,092 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 08:34:52,094 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 08:34:52,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,102 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 08:34:52,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,102 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,103 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,103 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,105 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,106 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,106 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,110 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,110 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,110 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,111 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:52,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,113 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,113 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,114 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,116 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,116 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,116 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,119 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,119 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,119 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:52,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,124 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,124 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,125 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:52,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,132 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 08:34:52,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 08:34:52,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:52,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,139 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 08:34:52,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,139 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,140 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,144 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,151 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,152 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,152 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,152 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 08:34:52,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,155 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,155 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,158 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,159 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,162 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,162 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,163 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,163 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 08:34:52,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:52,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,171 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,172 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:52,172 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,173 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 08:34:52,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,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 [2018-11-18 08:34:52,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 08:34:52,192 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 08:34:52,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:52,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:52,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:52,193 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 08:34:52,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:52,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:52,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:52,212 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 08:34:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:52,730 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-18 08:34:52,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:52,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-18 08:34:52,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 08:34:52,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 08:34:52,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 08:34:52,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 08:34:52,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-18 08:34:52,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:52,744 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 08:34:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-18 08:34:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 08:34:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 08:34:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 08:34:52,762 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 08:34:52,762 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 08:34:52,762 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:52,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-18 08:34:52,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 08:34:52,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:52,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:52,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:52,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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, 1, 1, 1] [2018-11-18 08:34:52,772 INFO L794 eck$LassoCheckResult]: Stem: 1792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-18 08:34:52,774 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1905#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2176#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2175#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); 2174#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; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2200#L606-3 assume true; 1898#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1772#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1773#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); 1926#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1956#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); 2144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2143#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); 2142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2139#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)); 2138#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); 2137#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); 2136#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); 2134#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2132#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); 2130#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2128#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2126#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2124#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); 2122#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); 2120#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2118#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); 2116#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2052#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2053#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); 2201#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2256#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); 2255#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); 2062#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2063#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2088#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2055#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2056#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); 2135#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2133#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2131#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2129#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); 2127#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2125#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2123#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); 2121#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2119#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); 2117#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); 2115#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2114#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); 2113#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2112#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2110#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)); 2108#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); 2106#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; 1816#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-18 08:34:52,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,775 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 08:34:52,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:52,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:52,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:52,790 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 08:34:52,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:52,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:52,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:52,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:52,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:34:52,845 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:52,846 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-18 08:34:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:53,517 INFO L93 Difference]: Finished difference Result 1228 states and 1700 transitions. [2018-11-18 08:34:53,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:53,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1700 transitions. [2018-11-18 08:34:53,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 08:34:53,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1700 transitions. [2018-11-18 08:34:53,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 08:34:53,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 08:34:53,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1700 transitions. [2018-11-18 08:34:53,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:53,539 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1700 transitions. [2018-11-18 08:34:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1700 transitions. [2018-11-18 08:34:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 08:34:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 08:34:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1694 transitions. [2018-11-18 08:34:53,562 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-18 08:34:53,562 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-18 08:34:53,562 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:53,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1694 transitions. [2018-11-18 08:34:53,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 08:34:53,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:53,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:53,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:53,571 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:53,571 INFO L794 eck$LassoCheckResult]: Stem: 3687#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-18 08:34:53,571 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4365#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4363#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4361#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); 4359#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4357#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); 4355#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4353#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); 4306#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; 3745#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4291#L606-3 assume true; 4290#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4289#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4288#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; 3706#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3809#L606-3 assume true; 3810#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4165#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4164#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); 4162#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4160#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); 4158#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4156#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); 4154#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4152#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)); 4150#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); 4148#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); 4146#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); 4144#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4142#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); 4140#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4138#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4136#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4134#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); 4132#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); 4130#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4128#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); 4126#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4124#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4122#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); 4120#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4118#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); 4116#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); 4114#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4112#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4110#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4108#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4106#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); 4104#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4102#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4100#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4098#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); 4096#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4094#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4092#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); 4090#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4088#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); 4086#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); 4084#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4082#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); 4080#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4078#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4076#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)); 4074#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); 4071#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; 4072#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-18 08:34:53,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 08:34:53,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:53,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:53,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 08:34:53,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:53,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:53,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:53,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:53,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:53,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:53,653 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:53,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:53,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:53,654 INFO L87 Difference]: Start difference. First operand 1225 states and 1694 transitions. cyclomatic complexity: 471 Second operand 3 states. [2018-11-18 08:34:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,032 INFO L93 Difference]: Finished difference Result 1509 states and 2003 transitions. [2018-11-18 08:34:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:54,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2003 transitions. [2018-11-18 08:34:54,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 08:34:54,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2003 transitions. [2018-11-18 08:34:54,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 08:34:54,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 08:34:54,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2003 transitions. [2018-11-18 08:34:54,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:54,045 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2003 transitions. [2018-11-18 08:34:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2003 transitions. [2018-11-18 08:34:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 08:34:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 08:34:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2001 transitions. [2018-11-18 08:34:54,059 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-18 08:34:54,059 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-18 08:34:54,059 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:54,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2001 transitions. [2018-11-18 08:34:54,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 08:34:54,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:54,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,066 INFO L794 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 08:34:54,066 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7490#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7488#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7486#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); 7484#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6439#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); 6371#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6372#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); 6545#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6309#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)); 6310#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); 6311#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); 6312#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); 6566#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6448#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); 6449#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7689#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7687#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7685#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; 6544#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6935#L606-3 assume true; 6933#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6931#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6929#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; 6410#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6937#L606-3 assume true; 6936#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6934#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6932#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); 6930#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6928#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); 6926#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6924#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); 6922#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6920#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)); 6918#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); 6916#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); 6914#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); 6912#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6910#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); 6908#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6906#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6904#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6902#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); 6900#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); 6898#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6896#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); 6894#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6892#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6890#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); 6888#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6886#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); 6884#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); 6882#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6880#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6878#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6876#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6874#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); 6872#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6870#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6868#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6866#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); 6864#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6862#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6860#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); 6858#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6856#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); 6854#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); 6852#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6850#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); 6848#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6846#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6844#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)); 6842#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); 6838#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; 6839#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-18 08:34:54,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 08:34:54,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 08:34:54,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 08:34:54,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:54,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:54,107 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:54,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:54,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,107 INFO L87 Difference]: Start difference. First operand 1508 states and 2001 transitions. cyclomatic complexity: 495 Second operand 3 states. [2018-11-18 08:34:54,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,485 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-18 08:34:54,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:54,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-18 08:34:54,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 08:34:54,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 08:34:54,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 08:34:54,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 08:34:54,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-18 08:34:54,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:54,504 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 08:34:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-18 08:34:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 08:34:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 08:34:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 08:34:54,524 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 08:34:54,524 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 08:34:54,524 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:34:54,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-18 08:34:54,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 08:34:54,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:54,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,532 INFO L794 eck$LassoCheckResult]: Stem: 9452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-18 08:34:54,532 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 9997#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9995#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9993#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); 9991#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9989#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); 9987#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9985#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); 9983#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9981#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)); 9979#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); 9977#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); 9975#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); 9973#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9971#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); 9969#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9967#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9965#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9888#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); 9889#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); 10114#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10112#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); 10110#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10108#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10106#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); 10104#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10102#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); 10100#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); 10097#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9780#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; 9671#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9773#L606-3 assume true; 9771#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9769#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9767#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); 9765#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9763#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); 9761#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9759#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); 9757#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9755#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)); 9753#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); 9751#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); 9749#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); 9747#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9745#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); 9743#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9741#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9739#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9737#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); 9735#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); 9733#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9731#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); 9729#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9727#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9725#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); 9723#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9721#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); 9719#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); 9716#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9714#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9712#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9710#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9708#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); 9706#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9704#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9702#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9700#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); 9698#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9696#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9694#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); 9692#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9690#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); 9688#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); 9686#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9684#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); 9682#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9680#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9678#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)); 9676#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); 9673#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; 9674#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 08:34:54,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,532 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 08:34:54,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,537 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 08:34:54,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:54,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:54,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:54,599 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:34:54,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:54,600 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-18 08:34:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:54,834 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-18 08:34:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:54,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-18 08:34:54,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 08:34:54,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 08:34:54,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 08:34:54,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 08:34:54,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-18 08:34:54,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:54,851 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 08:34:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-18 08:34:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 08:34:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 08:34:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 08:34:54,869 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 08:34:54,869 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 08:34:54,869 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:34:54,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-18 08:34:54,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 08:34:54,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,877 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:54,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,877 INFO L794 eck$LassoCheckResult]: Stem: 12455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 08:34:54,878 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13009#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13007#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13005#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); 13003#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13001#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); 12999#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12997#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); 12995#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 12993#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)); 12991#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); 12989#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); 12987#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); 12985#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12983#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); 12981#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12979#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12977#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12975#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); 12973#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); 12971#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12969#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); 12967#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12965#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12963#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); 12961#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12959#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); 12957#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); 12955#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12852#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12853#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13625#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13623#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); 13621#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13619#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13617#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13615#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); 13613#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13611#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13609#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); 13607#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13605#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); 13603#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); 13601#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13598#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); 13595#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12851#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12424#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)); 12425#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); 12426#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); 12427#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 12428#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); 12602#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12505#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 12506#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); 12447#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); 12448#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 12507#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 12451#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); 12452#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 12429#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); 12402#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); 12403#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12534#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)); 12535#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 12512#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); 12398#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 12399#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)); 12508#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 12390#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 12391#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12388#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)); 12389#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12511#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)); 12419#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12420#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12469#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12470#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); 12510#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12531#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12357#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12358#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12503#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12504#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12605#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13634#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13633#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12354#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12550#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12551#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13631#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13630#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13131#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13105#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13104#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13102#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13100#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13097#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13095#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13093#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13091#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13089#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13087#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13085#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13083#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13081#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13079#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13077#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13075#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13073#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13071#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13069#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13067#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12486#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13064#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13062#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13060#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13058#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13056#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13054#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13052#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13050#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13048#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13046#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13044#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13042#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13040#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13038#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13036#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13034#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13032#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13030#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13028#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13026#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13024#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13022#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13020#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13018#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13016#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13014#L594-1 calculate_output_#res := -2; 13012#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-18 08:34:54,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 08:34:54,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 08:34:54,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:54,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 08:34:54,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:55,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:55,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 08:34:55,987 WARN L180 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 08:34:56,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 08:34:56,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:34:56,054 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-18 08:34:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:56,854 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-18 08:34:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 08:34:56,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-18 08:34:56,861 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 08:34:56,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-18 08:34:56,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 08:34:56,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 08:34:56,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-18 08:34:56,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:56,873 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-18 08:34:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-18 08:34:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 08:34:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 08:34:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-18 08:34:56,897 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 08:34:56,897 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 08:34:56,897 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 08:34:56,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-18 08:34:56,903 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 08:34:56,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:56,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:56,903 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:56,903 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:56,904 INFO L794 eck$LassoCheckResult]: Stem: 15663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16354#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16352#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16350#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); 16348#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; 15803#L597 [2018-11-18 08:34:56,904 INFO L796 eck$LassoCheckResult]: Loop: 15803#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16276#L606-3 assume true; 16274#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16272#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16270#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); 16268#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16266#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); 16264#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16262#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; 15803#L597 [2018-11-18 08:34:56,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 08:34:56,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 08:34:56,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:56,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 08:34:56,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:56,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:56,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:56,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,132 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-18 08:34:57,165 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:57,165 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:57,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:57,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:57,165 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 08:34:57,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:57,165 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:57,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 08:34:57,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:57,165 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:57,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:57,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:57,377 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,391 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,391 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,412 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,430 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,432 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,432 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,449 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,449 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,467 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,467 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,484 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,485 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,501 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,502 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,502 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,518 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,520 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,520 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,539 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,539 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,555 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,555 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,557 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,557 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,574 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,576 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,576 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,593 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,594 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/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 [2018-11-18 08:34:57,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,615 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,634 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,634 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,651 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,653 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,669 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:57,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,855 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,870 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:57,872 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:57,872 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:57,887 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 08:34:57,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:58,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:58,047 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/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 [2018-11-18 08:34:58,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:58,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:58,064 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:58,065 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:58,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:58,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:58,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:58,083 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 /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:58,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 08:34:58,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 08:34:58,100 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 08:34:58,100 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 08:34:58,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:58 BoogieIcfgContainer [2018-11-18 08:34:58,138 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:58,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:58,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:58,138 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:58,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:48" (3/4) ... [2018-11-18 08:34:58,145 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 08:34:58,177 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9457b491-3292-4514-925c-f0e36113d75b/bin-2019/uautomizer/witness.graphml [2018-11-18 08:34:58,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:58,178 INFO L168 Benchmark]: Toolchain (without parser) took 10840.71 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 491.8 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 367.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,179 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:58,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.87 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,179 INFO L168 Benchmark]: Boogie Preprocessor took 42.11 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,180 INFO L168 Benchmark]: RCFGBuilder took 883.53 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: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,180 INFO L168 Benchmark]: BuchiAutomizer took 9420.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.8 MB). Peak memory consumption was 545.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,180 INFO L168 Benchmark]: Witness Printer took 39.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:58,182 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.87 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.11 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 883.53 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: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9420.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 352.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.8 MB). Peak memory consumption was 545.9 MB. Max. memory is 11.5 GB. * Witness Printer took 39.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 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 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.4s. Construction of modules took 2.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3082 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s 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: 57ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - 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@1d9bb6a5=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b98fca9=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@1d9bb6a5=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b98fca9=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@1d9bb6a5=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@1b98fca9=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)) [L614] CALL calculate_output(input) [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] RET, EXPR calculate_output(input) [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)) [L614] CALL calculate_output(input) [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...