./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label22_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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label22_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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 03d2eba0c96e405e42abc242d8ae37d66c66f111 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:19,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:25:19,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:25:19,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:25:19,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:25:19,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:25:19,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:25:19,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:25:19,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:25:19,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:25:19,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:25:19,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:25:19,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:25:19,572 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:25:19,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:25:19,574 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:25:19,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:25:19,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:25:19,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:25:19,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:25:19,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:25:19,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:25:19,581 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:25:19,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:25:19,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:25:19,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:25:19,583 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:25:19,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:25:19,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:25:19,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:25:19,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:25:19,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:25:19,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:25:19,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:25:19,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:25:19,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:25:19,587 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:25:19,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:25:19,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:25:19,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:25:19,599 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:25:19,600 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:25:19,600 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:25:19,600 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:25:19,600 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:25:19,600 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:25:19,600 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:25:19,600 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:25:19,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:25:19,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:25:19,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:25:19,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:25:19,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:25:19,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:25:19,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:25:19,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:25:19,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:25:19,602 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:25:19,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:25:19,602 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:25:19,602 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:25:19,602 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:25:19,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:25:19,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:25:19,603 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:25:19,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:25:19,603 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:25:19,603 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:25:19,604 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:25:19,604 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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 -> 03d2eba0c96e405e42abc242d8ae37d66c66f111 [2018-11-18 16:25:19,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:25:19,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:25:19,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:25:19,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:25:19,640 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:25:19,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label22_true-unreach-call_false-termination.c [2018-11-18 16:25:19,686 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/data/19c7bb3a5/791063cca1964a5b9cf7bbf93ec5f17d/FLAG6c95f1894 [2018-11-18 16:25:20,060 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:25:20,061 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/sv-benchmarks/c/eca-rers2012/Problem02_label22_true-unreach-call_false-termination.c [2018-11-18 16:25:20,070 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/data/19c7bb3a5/791063cca1964a5b9cf7bbf93ec5f17d/FLAG6c95f1894 [2018-11-18 16:25:20,441 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/data/19c7bb3a5/791063cca1964a5b9cf7bbf93ec5f17d [2018-11-18 16:25:20,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:25:20,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:25:20,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:25:20,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:25:20,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:25:20,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d293ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20, skipping insertion in model container [2018-11-18 16:25:20,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:25:20,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:25:20,703 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:25:20,707 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:25:20,770 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:25:20,782 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:25:20,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20 WrapperNode [2018-11-18 16:25:20,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:25:20,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:25:20,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:25:20,784 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:25:20,838 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:25:20" (1/1) ... [2018-11-18 16:25:20,850 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:25:20" (1/1) ... [2018-11-18 16:25:20,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:25:20,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:25:20,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:25:20,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:25:20,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... [2018-11-18 16:25:20,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:25:20,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:25:20,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:25:20,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:25:20,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 16:25:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:25:20,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:25:21,682 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:25:21,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:25:21 BoogieIcfgContainer [2018-11-18 16:25:21,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:25:21,683 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:25:21,683 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:25:21,686 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:25:21,686 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:25:21,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:25:20" (1/3) ... [2018-11-18 16:25:21,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6bff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:25:21, skipping insertion in model container [2018-11-18 16:25:21,687 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:25:21,688 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:25:20" (2/3) ... [2018-11-18 16:25:21,688 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6bff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:25:21, skipping insertion in model container [2018-11-18 16:25:21,688 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:25:21,688 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:25:21" (3/3) ... [2018-11-18 16:25:21,690 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label22_true-unreach-call_false-termination.c [2018-11-18 16:25:21,723 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:25:21,723 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:25:21,723 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:25:21,723 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:25:21,723 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:25:21,723 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:25:21,724 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:25:21,724 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:25:21,724 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:25:21,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 16:25:21,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 16:25:21,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:21,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:21,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:21,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:25:21,769 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:25:21,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 16:25:21,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 16:25:21,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:21,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:21,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:21,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 16:25:21,782 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:25:21,782 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:25:21,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 16:25:21,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:21,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:21,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:21,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:21,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:21,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 16:25:21,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:21,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:21,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:21,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 16:25:21,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:21,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:21,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:21,959 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:25:21,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:25:21,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:25:22,062 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:22,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:22,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:22,064 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:22,064 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:25:22,064 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:22,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:22,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:22,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 16:25:22,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:22,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:22,081 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:25:22,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:22,108 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:25:22,111 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:25:22,115 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:25:22,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:22,120 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:25:22,126 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:25:22,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:22,293 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,303 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:22,304 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:22,341 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,371 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:22,371 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,397 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:22,397 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,441 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:22,441 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,477 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:22,477 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:22,501 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:22,519 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:22,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:25:22,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:22,573 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:25:22,575 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:22,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:22,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:22,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:22,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:25:22,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:22,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:22,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:22,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 16:25:22,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:22,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:22,578 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:25:22,586 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:25:22,605 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:25:22,642 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:25:22,645 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:25:22,646 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:25:22,648 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:25:22,650 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:25:22,787 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:22,790 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:25:22,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:22,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:22,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,811 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:22,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:22,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:22,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:22,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:22,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:22,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,854 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:22,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:22,855 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:22,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,861 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 16:25:22,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:22,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,863 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,864 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:22,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,874 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,875 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:22,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,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:25:22,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,881 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:22,881 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,883 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 16:25:22,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,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:25:22,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:22,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:22,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,903 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,904 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:22,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,909 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,910 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:22,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,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:25:22,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,916 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,916 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:22,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,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:25:22,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,919 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:22,919 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:22,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:22,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,927 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 16:25:22,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,949 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:22,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:22,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,957 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,958 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:22,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,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:25:22,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,962 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:22,962 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,964 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:25:22,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,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:25:22,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,978 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,979 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:22,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,983 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:22,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:22,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:22,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:22,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:22,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,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:25:22,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:22,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:22,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:22,995 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:22,995 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:22,996 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:22,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:22,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:22,999 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 16:25:23,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,004 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,005 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,015 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,016 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,019 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:23,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,020 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 16:25:23,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,034 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,035 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,042 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,043 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,046 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,047 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,050 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:23,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,052 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:23,052 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,053 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:23,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,057 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 16:25:23,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:25:23,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,058 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,059 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,060 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:23,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,073 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,073 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,074 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,074 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:23,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,078 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,078 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:23,078 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,080 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 16:25:23,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,104 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,105 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,106 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:23,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,109 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,109 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,110 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,110 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:23,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,116 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,118 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,118 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:23,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,120 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,121 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,121 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:23,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,123 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:23,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:23,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:23,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,128 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 16:25:23,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,129 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,130 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,131 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,141 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,142 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,144 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,148 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,148 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:23,148 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,150 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:25:23,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,172 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,176 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,180 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,181 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,185 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,186 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,190 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,190 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,191 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,193 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:23,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,193 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:23,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,194 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:23,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,200 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 16:25:23,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,202 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,204 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,212 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,212 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,213 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,217 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,218 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:23,218 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,222 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 16:25:23,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,250 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,250 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,250 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,252 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,258 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,258 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,259 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,263 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,264 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,268 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,269 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,270 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:23,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,271 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,272 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:23,272 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:23,274 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:23,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,280 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 16:25:23,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,281 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,290 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,290 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,291 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,293 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,293 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:23,293 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,295 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:25:23,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,308 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,308 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,309 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,314 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,314 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,314 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,314 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,317 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,317 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,317 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,320 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,320 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,321 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:23,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,322 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:23,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,323 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:23,323 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:23,323 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:23,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,329 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 16:25:23,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,330 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,330 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:23,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,354 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,354 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:23,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,358 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,359 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 16:25:23,359 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,361 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 16:25:23,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,418 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,418 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,418 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:23,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:23,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,428 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,428 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:23,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,436 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,436 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:23,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:23,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,441 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:23,442 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:23,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,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:25:23,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:23,445 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:23,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:23,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:23,446 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:23,446 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:23,447 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:25:23,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:23,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:25:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:25:23,464 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 16:25:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:23,967 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 16:25:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:25:23,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 16:25:23,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 16:25:23,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 16:25:23,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 16:25:23,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 16:25:23,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 16:25:23,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:23,983 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 16:25:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 16:25:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 16:25:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 16:25:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 16:25:24,012 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 16:25:24,012 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 16:25:24,012 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:25:24,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 16:25:24,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 16:25:24,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:24,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:24,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:24,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:24,015 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:25:24,015 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:25:24,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 16:25:24,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:24,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:24,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:24,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 16:25:24,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:24,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:24,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:24,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:24,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:24,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 16:25:24,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:24,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:24,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:24,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:24,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:24,066 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:25:24,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:25:24,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:25:24,159 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:24,159 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:24,159 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:24,159 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:24,159 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:25:24,159 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:24,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:24,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:24,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 16:25:24,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:24,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:24,161 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:25:24,164 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:25:24,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:24,172 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:25:24,173 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:25:24,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:24,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:24,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:25:24,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:24,294 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:24,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:24,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:24,301 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:24,301 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:24,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:24,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:24,324 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:24,325 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:24,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:24,353 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:24,356 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:24,356 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:24,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:24,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:24,379 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:24,379 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:24,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:24,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:24,401 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:24,401 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:24,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:24,417 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:24,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:25:24,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:24,457 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:25:24,458 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:24,458 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:24,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:24,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:24,459 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:25:24,459 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:24,459 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:24,459 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:24,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 16:25:24,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:24,459 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:24,461 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:25:24,478 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:25:24,493 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:25:24,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:25:24,549 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:25:24,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:25:24,553 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:25:24,563 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:25:24,647 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:24,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:25:24,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:24,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:24,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,656 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:24,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:24,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,660 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,661 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,663 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,663 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:25:24,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:25:24,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,668 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 16:25:24,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,669 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,670 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,671 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,674 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,675 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,675 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,677 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,678 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,678 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,681 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,685 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,687 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 16:25:24,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,687 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,688 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,689 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,689 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,691 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,691 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,692 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,696 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,696 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,696 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,699 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,700 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,706 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,708 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 16:25:24,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,712 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,712 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,715 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,715 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,716 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:24,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,717 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,717 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,719 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,719 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,721 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,721 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,722 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:24,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,725 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,725 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,726 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:24,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:25:24,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,731 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,732 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,735 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 16:25:24,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,736 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,737 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,737 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,739 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,740 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,740 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,743 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,744 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,744 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,746 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,746 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,746 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,747 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,748 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,750 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,751 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,751 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,756 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,756 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,756 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,764 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,764 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 16:25:24,765 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 16:25:24,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,768 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 16:25:24,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,769 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,773 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,773 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,774 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,779 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,779 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,780 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,782 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,782 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,784 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,788 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,789 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,796 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,796 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,798 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,809 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 16:25:24,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,809 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,816 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 16:25:24,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,817 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,818 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,822 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,824 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,830 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,830 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,830 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,830 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,832 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:24,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,833 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,834 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,835 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,836 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,836 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,837 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,842 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,842 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,842 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,844 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:24,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,853 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,853 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,853 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,856 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 16:25:24,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,873 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,873 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 16:25:24,875 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 16:25:24,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,884 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 16:25:24,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,885 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,885 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,887 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,892 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,893 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,895 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,895 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,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:25:24,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,898 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,900 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,901 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,906 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,906 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,907 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:25:24,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,914 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 16:25:24,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 16:25:24,915 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:25:24,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,921 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 16:25:24,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,922 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:25:24,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,926 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,926 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,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:25:24,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,934 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,934 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,934 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,935 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:25:24,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,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:25:24,937 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,937 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,937 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,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:25:24,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,940 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,941 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,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:25:24,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,944 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,944 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,946 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:25:24,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:25:24,954 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,954 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,954 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:25:24,954 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,956 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 16:25:24,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,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:25:24,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 16:25:24,977 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 16:25:24,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:25:24,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:25:24,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:25:24,978 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 16:25:24,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:25:24,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:25:24,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:25:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:25:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:25:25,000 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 16:25:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:25,466 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-18 16:25:25,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:25:25,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-18 16:25:25,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 16:25:25,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 16:25:25,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 16:25:25,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 16:25:25,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-18 16:25:25,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:25,478 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 16:25:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-18 16:25:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 16:25:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 16:25:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 16:25:25,494 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 16:25:25,494 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 16:25:25,494 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:25:25,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-18 16:25:25,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 16:25:25,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:25,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:25,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:25,498 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:25:25,498 INFO L794 eck$LassoCheckResult]: Stem: 1797#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:25:25,499 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2315#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1774#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; 1775#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); 1940#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; 2187#L606-3 assume true; 2185#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2183#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; 2181#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); 2179#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2177#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); 2175#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2172#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); 2170#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2168#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)); 2166#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); 2164#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); 2162#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); 2160#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2158#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); 2156#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2154#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2152#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2150#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); 2148#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); 2146#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2144#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); 2142#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2140#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2138#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); 2136#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2134#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); 2132#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); 2131#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2129#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2127#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2125#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2123#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); 2121#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2119#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2118#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2116#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); 2115#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2114#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2112#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); 2113#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2210#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); 2211#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); 1941#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1839#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); 1840#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1894#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1762#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)); 1763#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); 1764#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; 1783#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:25:25,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 16:25:25,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:25,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:25,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 16:25:25,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:25,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:25,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:25,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:25,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:25,556 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:25:25,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:25:25,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:25:25,556 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:25:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:25:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:25:25,557 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 16:25:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:26,273 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-18 16:25:26,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:25:26,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-18 16:25:26,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 16:25:26,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-18 16:25:26,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 16:25:26,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 16:25:26,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-18 16:25:26,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:26,284 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-18 16:25:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-18 16:25:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 16:25:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 16:25:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-18 16:25:26,298 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 16:25:26,298 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 16:25:26,298 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:25:26,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-18 16:25:26,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 16:25:26,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:26,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:26,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:26,305 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:25:26,305 INFO L794 eck$LassoCheckResult]: Stem: 3695#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:25:26,305 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4681#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4680#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; 4679#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); 4678#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4677#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); 4675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4673#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); 4671#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; 3744#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4748#L606-3 assume true; 4746#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4744#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; 4739#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; 3656#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4735#L606-3 assume true; 4734#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4732#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; 4727#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); 4726#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4724#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); 4722#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4720#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); 4718#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4713#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)); 4710#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); 3571#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); 3573#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); 3830#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4687#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); 4686#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4685#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4683#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4648#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); 4603#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); 4362#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4359#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); 4317#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4316#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4315#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); 4314#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4312#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); 4311#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); 4310#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4309#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4308#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4307#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4306#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); 4305#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4302#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4301#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4298#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); 4297#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4294#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4293#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); 4290#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4289#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); 4287#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); 4285#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4283#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); 4281#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4279#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4277#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)); 4275#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); 4272#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; 4273#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:25:26,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 16:25:26,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:26,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:26,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:26,310 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 16:25:26,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:26,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:26,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:26,356 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:25:26,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:25:26,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:25:26,357 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:25:26,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:25:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:25:26,357 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-18 16:25:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:26,717 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-18 16:25:26,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:25:26,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-18 16:25:26,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 16:25:26,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-18 16:25:26,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 16:25:26,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 16:25:26,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-18 16:25:26,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:26,731 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-18 16:25:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-18 16:25:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 16:25:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 16:25:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-18 16:25:26,743 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 16:25:26,743 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 16:25:26,743 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:25:26,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-18 16:25:26,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 16:25:26,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:26,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:26,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:26,749 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:25:26,749 INFO L794 eck$LassoCheckResult]: Stem: 6429#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:25:26,750 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7462#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7460#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; 7458#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); 7456#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7455#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); 7453#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7452#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); 7450#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7451#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)); 7447#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); 7448#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); 7728#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); 7726#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7724#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); 7722#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7720#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7718#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7115#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; 6539#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7104#L606-3 assume true; 7101#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7097#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; 7094#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; 6450#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; 7330#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; 7328#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); 7313#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); 7111#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 7112#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); 7341#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 7710#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); 7706#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); 7049#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 7050#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 7316#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 7317#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 7329#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); 7326#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 7327#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7337#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 7338#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); 7319#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 7320#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6684#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); 6685#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7583#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); 7321#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); 7322#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 7527#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); 7525#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 7523#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 7521#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)); 7519#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); 7466#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; 6849#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:25:26,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:26,750 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 16:25:26,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:26,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:26,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:26,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 16:25:26,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:26,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:26,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:26,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:26,791 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:25:26,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:25:26,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:25:26,792 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:25:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:25:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:25:26,792 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-18 16:25:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:27,123 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-18 16:25:27,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:25:27,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-18 16:25:27,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 16:25:27,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 16:25:27,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 16:25:27,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 16:25:27,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-18 16:25:27,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:27,134 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 16:25:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-18 16:25:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 16:25:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 16:25:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 16:25:27,145 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 16:25:27,145 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 16:25:27,145 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 16:25:27,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-18 16:25:27,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 16:25:27,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:27,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:27,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:27,151 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:25:27,151 INFO L794 eck$LassoCheckResult]: Stem: 9448#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:25:27,151 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10394#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10392#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; 10390#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); 10388#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10386#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); 10384#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10382#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); 10380#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10378#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)); 10376#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); 10374#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); 10372#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); 10370#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10368#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); 10366#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10364#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10362#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10357#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); 10358#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); 10802#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10801#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); 9399#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9400#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9527#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); 9423#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9424#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); 9425#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); 9426#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9779#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; 9669#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9772#L606-3 assume true; 9770#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9768#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; 9766#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); 9764#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9762#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); 9760#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9758#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); 9756#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9754#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)); 9752#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); 9750#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); 9748#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); 9746#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9744#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); 9742#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9740#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9738#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9736#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); 9734#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); 9732#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9730#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); 9728#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9726#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9724#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); 9722#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9720#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); 9718#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); 9715#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9713#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9711#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9709#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9707#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); 9705#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9703#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9701#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9699#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); 9697#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9695#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9693#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); 9691#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9689#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); 9687#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); 9685#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9683#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); 9681#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9679#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9677#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)); 9675#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); 9672#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; 9673#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:25:27,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:27,151 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 16:25:27,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:27,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:27,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:27,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:27,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 16:25:27,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:27,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:27,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:25:27,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:27,222 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:25:27,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:25:27,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:25:27,222 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:25:27,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:25:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:25:27,223 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-18 16:25:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:27,410 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-18 16:25:27,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:25:27,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-18 16:25:27,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 16:25:27,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 16:25:27,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 16:25:27,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 16:25:27,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-18 16:25:27,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:27,425 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 16:25:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-18 16:25:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 16:25:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 16:25:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 16:25:27,444 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 16:25:27,444 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 16:25:27,444 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 16:25:27,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-18 16:25:27,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 16:25:27,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:27,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:27,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 16:25:27,450 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:25:27,450 INFO L794 eck$LassoCheckResult]: Stem: 12457#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:25:27,451 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13348#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13346#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; 13344#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); 13342#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13340#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); 13338#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13337#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); 13335#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13334#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)); 13333#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); 13332#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); 13330#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); 13329#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13324#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); 13323#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13321#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13319#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13317#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); 13315#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); 13313#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13311#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); 13309#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13307#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13305#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); 13303#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13301#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); 13299#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); 13297#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13295#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13293#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13291#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13289#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); 13287#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13285#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13283#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13281#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); 13279#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13277#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13275#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); 13273#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13271#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); 13269#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); 13267#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13265#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); 13263#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13261#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13259#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)); 13257#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); 13255#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); 13253#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13251#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); 13249#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13247#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13245#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); 13243#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); 13241#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13239#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13237#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); 13235#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13233#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); 13231#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); 13229#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13227#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)); 13225#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13223#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); 13221#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13219#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)); 13217#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13215#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13213#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13211#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)); 13209#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13207#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)); 13205#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13203#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13201#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13199#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); 13197#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13195#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13193#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13191#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13189#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13187#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13185#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13183#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13181#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12355#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13178#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13176#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13174#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13172#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13170#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13168#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13166#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13164#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13162#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13159#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13157#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13155#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13153#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13151#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13149#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13147#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13145#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13143#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13141#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13139#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13137#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13136#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13134#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13133#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13131#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12487#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13402#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13400#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13399#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13397#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13395#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13393#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13391#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13389#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13387#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13385#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13383#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13381#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13379#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13377#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13375#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13373#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13371#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13369#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13367#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13365#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13363#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13361#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13359#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13357#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13355#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13353#L594-1 calculate_output_#res := -2; 13351#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:25:27,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 16:25:27,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:27,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 16:25:27,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:27,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:27,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 16:25:27,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:27,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:27,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:25:27,876 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:25:27,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:25:27,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:25:28,524 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 16:25:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:25:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:25:28,586 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-18 16:25:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:25:29,343 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-18 16:25:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:25:29,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-18 16:25:29,353 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 16:25:29,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-18 16:25:29,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 16:25:29,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 16:25:29,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-18 16:25:29,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:25:29,363 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-18 16:25:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-18 16:25:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 16:25:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 16:25:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-18 16:25:29,383 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 16:25:29,383 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 16:25:29,383 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 16:25:29,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-18 16:25:29,389 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 16:25:29,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:25:29,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:25:29,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:29,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:25:29,390 INFO L794 eck$LassoCheckResult]: Stem: 15663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16940#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16938#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; 16936#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); 16293#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; 15806#L597 [2018-11-18 16:25:29,390 INFO L796 eck$LassoCheckResult]: Loop: 15806#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16269#L606-3 assume true; 16267#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16265#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; 16263#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); 16261#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16259#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); 16257#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16255#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; 15806#L597 [2018-11-18 16:25:29,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 16:25:29,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:29,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:29,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:29,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 16:25:29,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:29,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:29,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:29,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:29,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:29,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:25:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 16:25:29,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:25:29,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:25:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:29,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:25:29,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:25:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:25:29,625 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:25:29,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:25:29,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:25:29,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:25:29,626 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:25:29,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:25:29,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:25:29,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:25:29,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 16:25:29,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:25:29,626 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:25:29,628 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:25:29,634 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:25:29,636 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:25:29,637 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:25:29,639 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:25:29,641 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:25:29,643 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:25:29,645 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:25:29,647 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:25:29,649 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:25:29,650 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:25:29,652 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:25:29,654 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:25:29,655 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:25:29,657 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:25:29,659 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:25:29,666 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:25:29,668 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:25:29,677 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:25:29,680 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:25:29,682 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:25:29,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:25:29,823 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,830 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,830 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,848 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,848 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,870 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,899 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,899 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,918 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,945 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,945 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,973 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:29,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:29,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:29,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:29,993 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,021 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,021 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,041 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,059 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,061 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,061 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,087 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,105 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,120 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,120 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,122 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,123 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,141 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,141 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,157 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:25:30,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,359 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,359 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,382 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,382 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,400 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:25:30,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,552 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,575 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,575 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,593 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,593 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_d9199a56-0f3c-4a6d-919a-d7154cf574c8/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:25:30,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:25:30,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:25:30,613 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 16:25:30,613 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:25:30,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:25:30 BoogieIcfgContainer [2018-11-18 16:25:30,647 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:25:30,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:25:30,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:25:30,647 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:25:30,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:25:21" (3/4) ... [2018-11-18 16:25:30,650 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 16:25:30,686 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d9199a56-0f3c-4a6d-919a-d7154cf574c8/bin-2019/uautomizer/witness.graphml [2018-11-18 16:25:30,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:25:30,686 INFO L168 Benchmark]: Toolchain (without parser) took 10243.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 510.7 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 384.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:30,687 INFO L168 Benchmark]: CDTParser took 0.14 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:25:30,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.10 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 916.2 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:25:30,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 916.2 MB in the beginning and 1.1 GB in the end (delta: -231.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:30,688 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 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: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:30,688 INFO L168 Benchmark]: RCFGBuilder took 755.83 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: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:30,688 INFO L168 Benchmark]: BuchiAutomizer took 8963.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.1 MB). Peak memory consumption was 541.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:25:30,689 INFO L168 Benchmark]: Witness Printer took 38.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:25:30,691 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.14 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 339.10 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 916.2 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 100.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 916.2 MB in the beginning and 1.1 GB in the end (delta: -231.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.61 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: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 755.83 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: 107.4 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8963.41 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.1 MB). Peak memory consumption was 541.7 MB. Max. memory is 11.5 GB. * Witness Printer took 38.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 2.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s 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: 59ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c4c92b1=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f524a77=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@5c4c92b1=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f524a77=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@5c4c92b1=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@f524a77=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...