./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label11_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_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label11_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 8bc5807873c5a4343353326fda69b22e512eabea .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:09:49,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:09:49,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:09:49,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:09:49,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:09:49,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:09:49,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:09:49,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:09:49,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:09:49,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:09:49,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:09:49,498 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:09:49,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:09:49,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:09:49,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:09:49,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:09:49,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:09:49,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:09:49,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:09:49,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:09:49,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:09:49,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:09:49,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:09:49,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:09:49,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:09:49,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:09:49,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:09:49,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:09:49,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:09:49,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:09:49,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:09:49,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:09:49,515 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:09:49,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:09:49,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:09:49,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:09:49,516 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:09:49,529 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:09:49,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:09:49,531 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:09:49,531 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:09:49,531 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:09:49,531 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:09:49,531 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:09:49,531 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:09:49,532 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:09:49,532 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:09:49,532 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:09:49,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:09:49,532 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:09:49,532 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:09:49,533 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:09:49,533 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:09:49,533 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:09:49,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:09:49,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:09:49,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:09:49,534 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:09:49,534 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:09:49,534 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:09:49,534 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:09:49,534 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:09:49,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:09:49,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:09:49,535 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:09:49,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:09:49,535 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:09:49,535 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:09:49,536 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:09:49,536 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 -> 8bc5807873c5a4343353326fda69b22e512eabea [2018-11-18 16:09:49,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:09:49,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:09:49,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:09:49,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:09:49,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:09:49,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label11_true-unreach-call_false-termination.c [2018-11-18 16:09:49,622 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/data/f12efefaf/1fd636b2668441d099298e70cabc3e6a/FLAG20e15bc85 [2018-11-18 16:09:50,002 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:09:50,003 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/sv-benchmarks/c/eca-rers2012/Problem02_label11_true-unreach-call_false-termination.c [2018-11-18 16:09:50,011 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/data/f12efefaf/1fd636b2668441d099298e70cabc3e6a/FLAG20e15bc85 [2018-11-18 16:09:50,023 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/data/f12efefaf/1fd636b2668441d099298e70cabc3e6a [2018-11-18 16:09:50,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:09:50,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:09:50,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:09:50,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:09:50,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:09:50,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea45065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50, skipping insertion in model container [2018-11-18 16:09:50,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:09:50,079 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:09:50,301 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:09:50,305 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:09:50,366 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:09:50,379 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:09:50,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50 WrapperNode [2018-11-18 16:09:50,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:09:50,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:09:50,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:09:50,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:09:50,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:09:50,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:09:50,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:09:50,486 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:09:50,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... [2018-11-18 16:09:50,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:09:50,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:09:50,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:09:50,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:09:50,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:50,584 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 16:09:50,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:09:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:09:51,496 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:09:51,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:09:51 BoogieIcfgContainer [2018-11-18 16:09:51,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:09:51,498 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:09:51,498 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:09:51,501 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:09:51,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:09:51,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:09:50" (1/3) ... [2018-11-18 16:09:51,502 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54aaff6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:09:51, skipping insertion in model container [2018-11-18 16:09:51,502 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:09:51,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:09:50" (2/3) ... [2018-11-18 16:09:51,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54aaff6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:09:51, skipping insertion in model container [2018-11-18 16:09:51,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:09:51,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:09:51" (3/3) ... [2018-11-18 16:09:51,504 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label11_true-unreach-call_false-termination.c [2018-11-18 16:09:51,539 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:09:51,539 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:09:51,539 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:09:51,539 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:09:51,539 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:09:51,540 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:09:51,540 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:09:51,540 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:09:51,540 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:09:51,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 16:09:51,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 16:09:51,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:51,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:51,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:51,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:09:51,585 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:09:51,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 16:09:51,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 16:09:51,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:51,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:51,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:51,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:09:51,597 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 16:09:51,597 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 16:09:51,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 16:09:51,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:51,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:51,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:51,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,673 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 16:09:51,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:51,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:51,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:51,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 16:09:51,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:51,776 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 16:09:51,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:51,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:09:51,933 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-18 16:09:51,967 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:09:51,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:09:51,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:09:51,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:09:51,969 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:09:51,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:09:51,969 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:09:51,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:09:51,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label11_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 16:09:51,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:09:51,970 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:09:51,988 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 16:09:51,993 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 16:09:52,016 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 16:09:52,019 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 16:09:52,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:09:52,028 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 16:09:52,029 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 16:09:52,036 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 16:09:52,211 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:09:52,212 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,216 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:52,228 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:52,265 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,296 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,299 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:52,299 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,337 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:52,337 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,368 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:52,368 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:52,407 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:52,444 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:52,464 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:52,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:09:52,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:52,510 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:09:52,511 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:09:52,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:09:52,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:09:52,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:09:52,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:09:52,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:09:52,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:09:52,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:09:52,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label11_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 16:09:52,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:09:52,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:09:52,515 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 16:09:52,528 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 16:09:52,537 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 16:09:52,558 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 16:09:52,570 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 16:09:52,577 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 16:09:52,589 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 16:09:52,595 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 16:09:52,838 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-18 16:09:52,889 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:09:52,896 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:09:52,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:52,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:52,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:52,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:52,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:52,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,917 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:52,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:52,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:52,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:52,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:52,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:52,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:52,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:52,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:52,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:52,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,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 16:09:52,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,951 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:52,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:52,951 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:52,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,956 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 16:09:52,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 16:09:52,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:52,958 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:52,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,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 16:09:52,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:52,967 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:52,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,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 16:09:52,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,971 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:52,971 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:52,973 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 16:09:52,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:52,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:52,990 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:52,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,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 16:09:52,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,995 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:52,996 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:52,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:52,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:52,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:52,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:52,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:52,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:52,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:52,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:52,999 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:52,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,003 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:53,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,005 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,013 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 16:09:53,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 16:09:53,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,014 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,015 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,025 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,025 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,029 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:53,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,031 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:09:53,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,046 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,047 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,052 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,052 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,055 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,059 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,059 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,061 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,061 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,062 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:53,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,066 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 16:09:53,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,067 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,068 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,076 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,076 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,080 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:53,080 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,082 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 16:09:53,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,096 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,097 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,101 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,102 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,106 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,109 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,109 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:53,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,111 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,111 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,112 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:53,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,117 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 16:09:53,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,118 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,118 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,119 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:53,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,134 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,135 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:53,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,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 16:09:53,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,139 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,140 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:53,140 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,142 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 16:09:53,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,172 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,174 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:53,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,179 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,180 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:53,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,184 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,184 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:53,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,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 16:09:53,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,188 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,188 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,189 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:53,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,191 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,191 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:53,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,197 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 16:09:53,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,198 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,199 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,215 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,216 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,221 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,222 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:53,222 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,225 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:09:53,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,260 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,261 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,269 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,269 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,270 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,274 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,274 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,274 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,275 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,279 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,279 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,280 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,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 16:09:53,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,282 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:53,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,283 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,284 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:53,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,292 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 16:09:53,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,293 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,294 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,296 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,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 16:09:53,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,309 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,309 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,310 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,316 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,316 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:53,316 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,321 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 16:09:53,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,358 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,358 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,361 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,369 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,369 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,370 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,375 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,376 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,377 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,382 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,382 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,383 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:53,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,385 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,385 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,385 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:53,387 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:53,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,398 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 16:09:53,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,399 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,400 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,410 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,410 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,411 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,413 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,414 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:53,414 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,415 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:09:53,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,433 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,434 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,439 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,442 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,443 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,443 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,443 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,446 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,447 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:53,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,449 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,449 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:53,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,449 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,449 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:53,450 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:53,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,456 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 16:09:53,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,457 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,457 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,489 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,490 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,494 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,494 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:09:53,495 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,498 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 16:09:53,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,576 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,576 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,588 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,589 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,594 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:53,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,599 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:53,599 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:53,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:53,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:53,604 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:53,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:53,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:53,604 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:53,604 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:53,606 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:09:53,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:53,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:53,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:53,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:53,632 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 16:09:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:54,282 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 16:09:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:54,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 16:09:54,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 16:09:54,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 16:09:54,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 16:09:54,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 16:09:54,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 16:09:54,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:09:54,297 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 16:09:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 16:09:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 16:09:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 16:09:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 16:09:54,329 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 16:09:54,329 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 16:09:54,329 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:09:54,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 16:09:54,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 16:09:54,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:54,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:54,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:54,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:09:54,333 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 16:09:54,333 INFO L796 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 860#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); 886#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); 761#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 947#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); 945#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 944#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 16:09:54,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:54,333 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 16:09:54,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:54,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:54,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:54,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 16:09:54,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:54,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:54,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:09:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:54,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:54,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 16:09:54,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:54,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:54,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:54,376 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 16:09:54,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:54,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:09:54,477 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:09:54,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:09:54,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:09:54,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:09:54,477 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:09:54,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:09:54,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:09:54,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:09:54,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label11_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 16:09:54,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:09:54,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:09:54,479 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 16:09:54,485 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 16:09:54,489 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 16:09:54,492 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 16:09:54,494 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 16:09:54,496 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 16:09:54,501 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 16:09:54,508 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 16:09:54,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:09:54,592 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:54,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:54,595 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:54,597 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:54,598 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:54,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:54,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:54,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:54,617 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:54,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:54,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:54,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:54,636 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:54,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:54,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:54,655 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:54,655 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:54,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:54,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:54,673 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:09:54,673 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:54,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:09:54,690 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:09:54,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:09:54,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:09:54,733 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:09:54,735 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:09:54,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:09:54,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:09:54,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:09:54,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:09:54,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:09:54,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:09:54,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:09:54,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label11_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 16:09:54,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:09:54,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:09:54,737 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 16:09:54,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:09:54,745 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 16:09:54,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 16:09:54,750 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 16:09:54,761 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 16:09:54,765 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 16:09:54,776 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 16:09:54,864 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:09:54,864 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:09:54,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 16:09:54,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:54,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:54,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,878 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,878 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:54,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:54,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,883 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,885 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,886 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:09:54,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:09:54,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,890 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 16:09:54,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,891 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,892 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,894 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,894 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,896 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,896 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:54,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,898 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,900 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,900 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:54,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,902 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:54,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,905 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,905 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:54,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:54,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,910 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,910 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,912 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 16:09:54,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:54,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,913 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,914 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,919 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,919 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,919 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:54,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,921 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,921 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,923 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,923 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,925 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,925 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,926 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:54,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,929 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,929 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,929 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:54,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:54,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:54,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,938 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 16:09:54,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 16:09:54,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,939 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,939 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:54,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:54,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,941 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:54,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,945 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:54,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:54,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,948 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,948 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:54,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,951 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,951 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:54,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,955 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,955 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,956 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:54,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:09:54,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:54,962 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:54,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,965 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 16:09:54,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 16:09:54,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,966 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,966 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,969 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,970 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,970 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,973 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,974 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,974 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:54,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,976 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,976 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,976 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,977 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,978 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,978 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,980 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,981 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,981 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:54,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,985 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,986 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:54,986 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:54,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,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 16:09:54,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:54,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,994 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:09:54,995 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:09:54,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:54,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:54,998 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 16:09:54,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:54,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:54,999 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:54,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:54,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:54,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:54,999 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,000 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,003 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:55,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,003 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,004 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,008 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:55,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,008 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,008 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:55,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,011 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:55,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,013 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:55,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,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 16:09:55,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,017 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:55,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,017 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,018 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:55,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:55,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,024 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:55,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,024 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,024 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,026 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:55,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,037 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:09:55,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,037 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,038 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,044 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 16:09:55,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,045 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,046 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,047 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:55,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,052 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,052 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,054 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:55,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,060 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,061 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,061 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,062 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:55,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,064 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,065 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:55,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,067 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,067 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,068 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:55,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,077 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,077 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,077 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,079 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:55,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,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 16:09:55,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,092 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,092 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,092 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,095 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:09:55,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,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 16:09:55,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,120 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:09:55,123 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:09:55,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,132 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 16:09:55,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:55,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,134 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,134 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,136 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,137 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:55,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,141 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,141 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,142 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:55,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:55,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,144 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,144 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,145 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:55,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,148 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,148 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,150 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,151 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,151 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:55,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,207 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,207 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,207 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,208 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,209 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:09:55,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:09:55,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,220 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:09:55,220 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:09:55,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,228 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 16:09:55,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:55,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,229 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,229 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:55,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,233 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,233 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,234 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:55,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:09:55,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,242 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,243 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,243 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:09:55,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,246 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:55,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,250 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,250 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,250 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:55,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,254 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,254 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,255 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,256 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:09:55,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,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 16:09:55,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,265 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:09:55,265 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,267 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:09:55,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 16:09:55,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:09:55,290 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:09:55,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:09:55,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:09:55,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:09:55,291 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:09:55,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:09:55,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:09:55,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:09:55,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:55,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:55,313 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 16:09:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:55,841 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-18 16:09:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:55,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-18 16:09:55,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 16:09:55,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 16:09:55,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 16:09:55,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 16:09:55,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-18 16:09:55,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:09:55,856 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 16:09:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-18 16:09:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 16:09:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 16:09:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 16:09:55,877 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 16:09:55,877 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 16:09:55,877 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:09:55,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-18 16:09:55,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 16:09:55,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:55,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:55,882 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:55,882 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 16:09:55,882 INFO L794 eck$LassoCheckResult]: Stem: 1796#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 16:09:55,883 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2269#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2268#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; 2267#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); 2265#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; 1913#L606-3 assume true; 1907#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1776#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; 1777#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); 1934#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1965#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); 2180#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2179#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); 2178#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2177#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)); 2175#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); 2174#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); 2173#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); 2172#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2170#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); 2168#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2166#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2164#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2162#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); 2160#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); 2158#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2156#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); 2154#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2130#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2131#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); 2147#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2146#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); 2143#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); 2139#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2140#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2152#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2133#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2134#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); 2196#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2194#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2192#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2189#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); 1875#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1876#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2119#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); 2120#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2171#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); 2169#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); 2167#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2165#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); 2163#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2161#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2159#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)); 2157#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); 2155#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; 2150#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 16:09:55,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 16:09:55,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:55,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:55,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:55,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:55,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:55,889 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 16:09:55,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:55,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:09:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:55,964 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 16:09:55,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:55,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:09:55,964 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:09:55,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:09:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:09:55,965 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-18 16:09:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:56,625 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2018-11-18 16:09:56,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:09:56,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1701 transitions. [2018-11-18 16:09:56,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 16:09:56,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1701 transitions. [2018-11-18 16:09:56,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 16:09:56,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 16:09:56,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1701 transitions. [2018-11-18 16:09:56,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:09:56,648 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2018-11-18 16:09:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1701 transitions. [2018-11-18 16:09:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 16:09:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 16:09:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2018-11-18 16:09:56,666 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-18 16:09:56,666 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-18 16:09:56,666 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:09:56,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1695 transitions. [2018-11-18 16:09:56,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 16:09:56,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:56,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:56,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:56,674 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 16:09:56,674 INFO L794 eck$LassoCheckResult]: Stem: 3692#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 16:09:56,674 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 3811#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3672#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; 3673#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); 3839#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3701#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); 3631#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3632#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); 3820#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; 3749#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4401#L606-3 assume true; 4396#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4391#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; 4380#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; 3713#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4376#L606-3 assume true; 4374#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4372#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; 4370#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); 4368#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4366#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); 4364#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4362#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); 4360#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4358#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)); 4356#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); 4354#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); 4352#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); 4350#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4348#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); 4346#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4344#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4342#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4340#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); 4338#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); 4336#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4334#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); 4307#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4306#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4305#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); 4304#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4302#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); 4301#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); 4300#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4299#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4298#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4297#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4296#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); 4295#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4292#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4291#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4288#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); 4287#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4284#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4283#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); 4280#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4279#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); 4277#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); 4275#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4273#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); 4271#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4269#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4267#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)); 4265#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); 4263#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; 3857#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 16:09:56,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 16:09:56,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:56,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:56,680 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 16:09:56,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:56,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:56,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:09:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:56,732 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 16:09:56,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:56,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:56,734 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:09:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:56,734 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-18 16:09:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:57,159 INFO L93 Difference]: Finished difference Result 1509 states and 2004 transitions. [2018-11-18 16:09:57,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:57,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2004 transitions. [2018-11-18 16:09:57,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 16:09:57,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2004 transitions. [2018-11-18 16:09:57,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 16:09:57,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 16:09:57,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2004 transitions. [2018-11-18 16:09:57,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:09:57,181 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2004 transitions. [2018-11-18 16:09:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2004 transitions. [2018-11-18 16:09:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 16:09:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 16:09:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2002 transitions. [2018-11-18 16:09:57,202 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-18 16:09:57,202 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-18 16:09:57,202 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:09:57,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2002 transitions. [2018-11-18 16:09:57,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 16:09:57,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:57,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:57,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:57,211 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 16:09:57,211 INFO L794 eck$LassoCheckResult]: Stem: 6431#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 16:09:57,211 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7458#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7456#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; 7455#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); 7453#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7452#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); 7451#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7450#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); 7447#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7448#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)); 7444#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); 6510#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6432#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6433#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; 6546#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7109#L606-3 assume true; 7106#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7102#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; 7099#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; 6451#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7332#L606-3 assume true; 7331#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7329#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; 7315#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); 7314#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7312#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); 7310#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7308#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); 7306#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7304#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)); 7302#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); 7300#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); 7298#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); 7296#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7294#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); 7292#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7290#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7288#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7286#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); 7284#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); 7282#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 7280#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); 7278#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 7116#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 7117#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); 6407#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6408#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); 6409#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); 6410#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 7055#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 7317#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 7318#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 7330#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); 7327#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 7328#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7334#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 7335#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); 7320#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 7321#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6689#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); 6690#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7449#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); 7322#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); 7323#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 7721#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); 7720#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 7719#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 7717#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)); 7715#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); 7215#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; 6855#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 16:09:57,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:57,212 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 16:09:57,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:57,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:57,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:57,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:57,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 16:09:57,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:57,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:09:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:57,260 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 16:09:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:57,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:57,261 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:09:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:57,261 INFO L87 Difference]: Start difference. First operand 1508 states and 2002 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-18 16:09:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:57,705 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-18 16:09:57,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:57,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-18 16:09:57,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 16:09:57,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 16:09:57,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 16:09:57,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 16:09:57,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-18 16:09:57,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:09:57,721 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 16:09:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-18 16:09:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 16:09:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 16:09:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 16:09:57,741 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 16:09:57,741 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 16:09:57,741 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:09:57,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-18 16:09:57,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 16:09:57,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:57,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:57,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:57,748 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 16:09:57,748 INFO L794 eck$LassoCheckResult]: Stem: 9450#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 16:09:57,749 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10386#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10384#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; 10382#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); 10380#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10378#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); 10376#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10374#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); 10372#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10370#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)); 10368#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); 10366#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); 10364#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); 10362#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10360#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); 10358#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10356#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10354#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10350#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); 10351#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); 10822#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10821#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); 10820#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10819#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10818#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); 10817#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10816#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); 10815#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); 10814#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9782#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; 9673#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9775#L606-3 assume true; 9773#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9771#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; 9769#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); 9767#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9765#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); 9763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9761#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); 9759#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9757#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)); 9755#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); 9753#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); 9751#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); 9749#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9747#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); 9745#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9743#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9741#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9739#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); 9737#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); 9735#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9733#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); 9731#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9729#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9727#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); 9725#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9723#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); 9721#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); 9718#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9716#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9714#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9712#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9710#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); 9708#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9706#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9704#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9702#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); 9700#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9698#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9696#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); 9694#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9692#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); 9690#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); 9688#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9686#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); 9684#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9682#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9680#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)); 9678#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); 9675#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; 9676#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 16:09:57,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 16:09:57,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:57,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 16:09:57,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:57,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:09:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:57,814 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 16:09:57,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:57,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:09:57,815 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:09:57,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:09:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:09:57,815 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-18 16:09:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:09:58,152 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-18 16:09:58,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:09:58,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-18 16:09:58,159 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 16:09:58,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 16:09:58,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 16:09:58,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 16:09:58,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-18 16:09:58,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:09:58,169 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 16:09:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-18 16:09:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 16:09:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 16:09:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 16:09:58,187 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 16:09:58,187 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 16:09:58,187 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:09:58,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-18 16:09:58,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 16:09:58,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:09:58,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:09:58,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:09:58,194 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 16:09:58,194 INFO L794 eck$LassoCheckResult]: Stem: 12456#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 16:09:58,196 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13015#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13013#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; 13011#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); 13009#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13007#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); 13005#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13003#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); 13001#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 12999#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)); 12997#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); 12995#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); 12993#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); 12991#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12989#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); 12987#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12985#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12983#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12981#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); 12979#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); 12977#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12975#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); 12973#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12971#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12969#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); 12967#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12965#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); 12963#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); 12961#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12858#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12359#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12325#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12326#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); 13798#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13797#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13796#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13795#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); 13794#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13793#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13792#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); 13791#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13790#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); 13789#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); 13787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13785#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); 13783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12857#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); 12606#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12508#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 12509#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); 12448#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); 12449#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 12510#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 12452#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); 12453#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); 12538#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)); 12539#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13724#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); 13723#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13721#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)); 13719#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13717#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13715#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13713#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)); 13711#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13710#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)); 13708#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13706#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13704#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13702#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); 13700#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13698#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13696#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13694#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13692#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13690#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13688#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13686#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13618#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); 13725#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13616#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13615#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13614#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13613#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13135#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13109#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13108#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13106#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13103#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13101#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13099#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13097#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13095#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13093#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13091#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13089#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13087#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13085#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13083#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13081#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13079#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13077#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13075#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13073#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12489#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13070#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13068#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13066#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13064#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13062#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13060#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13058#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13056#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13054#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13052#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13050#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13048#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13046#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13044#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13042#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13040#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13038#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13036#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13034#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13032#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13030#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13028#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13026#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13024#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13022#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13020#L594-1 calculate_output_#res := -2; 13018#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 16:09:58,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 16:09:58,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:58,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:58,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 16:09:58,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:58,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:58,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:09:58,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:09:58,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 16:09:58,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:09:58,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:09:58,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:58,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:09:58,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:09:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:09:58,744 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 16:09:58,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:09:58,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:09:59,377 WARN L180 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 16:09:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:09:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:09:59,448 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-18 16:10:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:10:00,210 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-18 16:10:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:10:00,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-18 16:10:00,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 16:10:00,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-18 16:10:00,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 16:10:00,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 16:10:00,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-18 16:10:00,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:10:00,227 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-18 16:10:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-18 16:10:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 16:10:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 16:10:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-18 16:10:00,247 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 16:10:00,247 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 16:10:00,247 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 16:10:00,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-18 16:10:00,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 16:10:00,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:10:00,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:10:00,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:10:00,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:10:00,254 INFO L794 eck$LassoCheckResult]: Stem: 15665#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; 16357#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16355#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; 16353#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); 16351#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; 15809#L597 [2018-11-18 16:10:00,254 INFO L796 eck$LassoCheckResult]: Loop: 15809#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16279#L606-3 assume true; 16277#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16275#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; 16273#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); 16271#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16269#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); 16267#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16265#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; 15809#L597 [2018-11-18 16:10:00,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:10:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 16:10:00,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:10:00,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:10:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:00,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:10:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:10:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:10:00,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:10:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 16:10:00,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:10:00,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:10:00,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:00,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:10:00,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:10:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:10:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:10:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 16:10:00,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:10:00,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:10:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:00,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:10:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:10:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:10:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:10:00,477 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:10:00,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:10:00,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:10:00,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:10:00,478 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:10:00,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:10:00,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:10:00,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:10:00,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label11_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 16:10:00,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:10:00,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:10:00,480 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 16:10:00,484 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 16:10:00,486 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 16:10:00,488 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 16:10:00,490 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 16:10:00,492 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 16:10:00,496 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 16:10:00,499 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 16:10:00,501 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 16:10:00,504 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 16:10:00,506 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 16:10:00,509 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 16:10:00,511 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 16:10:00,514 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 16:10:00,517 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 16:10:00,519 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 16:10:00,528 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 16:10:00,536 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 16:10:00,543 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 16:10:00,546 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 16:10:00,550 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 16:10:00,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:10:00,714 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,718 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,720 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,721 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,745 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,767 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,768 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,790 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,790 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,812 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,814 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,814 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,836 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,859 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,881 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,903 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,903 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,922 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,924 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,924 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,945 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,945 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,963 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,966 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:00,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:00,985 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:00,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:00,988 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,011 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,033 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,053 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:10:01,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,279 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,280 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,302 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,337 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:10:01,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,527 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,528 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,549 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,550 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,571 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,571 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_cd57a250-70ec-49ad-aa64-b9da9531e679/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 16:10:01,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:10:01,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:10:01,594 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:10:01,594 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 16:10:01,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:10:01 BoogieIcfgContainer [2018-11-18 16:10:01,635 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:10:01,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:10:01,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:10:01,635 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:10:01,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:09:51" (3/4) ... [2018-11-18 16:10:01,638 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 16:10:01,676 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cd57a250-70ec-49ad-aa64-b9da9531e679/bin-2019/uautomizer/witness.graphml [2018-11-18 16:10:01,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:10:01,677 INFO L168 Benchmark]: Toolchain (without parser) took 11649.88 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.5 MB). Free memory was 957.0 MB in the beginning and 1.4 GB in the end (delta: -420.7 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:10:01,678 INFO L168 Benchmark]: CDTParser took 0.13 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 16:10:01,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 922.1 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:10:01,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 922.1 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:10:01,678 INFO L168 Benchmark]: Boogie Preprocessor took 42.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:10:01,679 INFO L168 Benchmark]: RCFGBuilder took 968.47 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: 102.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:10:01,679 INFO L168 Benchmark]: BuchiAutomizer took 10137.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -354.4 MB). Peak memory consumption was 490.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:10:01,680 INFO L168 Benchmark]: Witness Printer took 41.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 294.1 kB). Peak memory consumption was 294.1 kB. Max. memory is 11.5 GB. [2018-11-18 16:10:01,682 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.13 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 350.75 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 922.1 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 922.1 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 968.47 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: 102.5 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10137.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -354.4 MB). Peak memory consumption was 490.2 MB. Max. memory is 11.5 GB. * Witness Printer took 41.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 294.1 kB). Peak memory consumption was 294.1 kB. 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 10.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.8s. Construction of modules took 2.7s. Büchi inclusion checks took 1.0s. 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, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 81ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - 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@b8b4b07=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b872cb5=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@b8b4b07=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b872cb5=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@b8b4b07=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@2b872cb5=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...