./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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 e52247c97e0196dba144205e35fb286f9d95e245 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 10:52:02,131 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:52:02,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:52:02,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:52:02,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:52:02,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:52:02,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:52:02,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:52:02,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:52:02,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:52:02,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:52:02,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:52:02,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:52:02,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:52:02,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:52:02,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:52:02,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:52:02,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:52:02,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:52:02,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:52:02,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:52:02,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:52:02,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:52:02,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:52:02,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:52:02,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:52:02,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:52:02,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:52:02,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:52:02,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:52:02,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:52:02,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:52:02,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:52:02,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:52:02,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:52:02,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:52:02,158 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:52:02,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:52:02,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:52:02,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:52:02,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:52:02,167 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:52:02,167 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:52:02,168 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:52:02,168 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:52:02,168 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:52:02,168 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:52:02,168 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:52:02,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:52:02,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:52:02,169 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:52:02,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:52:02,170 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:52:02,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:52:02,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:52:02,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:52:02,170 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:52:02,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:52:02,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:52:02,171 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:52:02,174 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:52:02,174 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_d3904732-07a9-4c07-833e-59c738654de9/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 -> e52247c97e0196dba144205e35fb286f9d95e245 [2018-11-10 10:52:02,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:52:02,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:52:02,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:52:02,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:52:02,210 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:52:02,210 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-11-10 10:52:02,252 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/data/0bafe27b4/703eae1eb32945e0a751c13ab9bd774d/FLAG6306177bb [2018-11-10 10:52:02,717 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:52:02,717 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/sv-benchmarks/c/eca-rers2012/Problem02_label12_true-unreach-call_false-termination.c [2018-11-10 10:52:02,729 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/data/0bafe27b4/703eae1eb32945e0a751c13ab9bd774d/FLAG6306177bb [2018-11-10 10:52:02,741 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/data/0bafe27b4/703eae1eb32945e0a751c13ab9bd774d [2018-11-10 10:52:02,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:52:02,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:52:02,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:52:02,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:52:02,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:52:02,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:52:02" (1/1) ... [2018-11-10 10:52:02,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32089edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:02, skipping insertion in model container [2018-11-10 10:52:02,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:52:02" (1/1) ... [2018-11-10 10:52:02,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:52:02,794 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:52:03,011 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:52:03,015 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:52:03,075 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:52:03,088 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:52:03,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03 WrapperNode [2018-11-10 10:52:03,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:52:03,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:52:03,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:52:03,089 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:52:03,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:52:03,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:52:03,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:52:03,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:52:03,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... [2018-11-10 10:52:03,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:52:03,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:52:03,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:52:03,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:52:03,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:03,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:52:03,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:52:04,101 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:52:04,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:52:04 BoogieIcfgContainer [2018-11-10 10:52:04,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:52:04,102 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:52:04,103 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:52:04,105 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:52:04,106 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:52:04,106 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:52:02" (1/3) ... [2018-11-10 10:52:04,106 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cff8b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:52:04, skipping insertion in model container [2018-11-10 10:52:04,106 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:52:04,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:52:03" (2/3) ... [2018-11-10 10:52:04,107 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cff8b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:52:04, skipping insertion in model container [2018-11-10 10:52:04,107 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:52:04,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:52:04" (3/3) ... [2018-11-10 10:52:04,108 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label12_true-unreach-call_false-termination.c [2018-11-10 10:52:04,141 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:52:04,141 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:52:04,141 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:52:04,141 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:52:04,141 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:52:04,142 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:52:04,142 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:52:04,142 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:52:04,142 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:52:04,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 10:52:04,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 10:52:04,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:04,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:04,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:04,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:52:04,186 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:52:04,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 10:52:04,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 10:52:04,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:04,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:04,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:04,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:52:04,198 INFO L793 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-10 10:52:04,198 INFO L795 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 !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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 ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~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-10 10:52:04,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 10:52:04,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:04,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:04,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:04,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:04,271 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 10:52:04,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:04,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:04,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:04,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:04,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:04,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:04,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 10:52:04,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:04,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:04,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:04,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:04,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:52:04,355 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-10 10:52:04,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:52:04,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:52:04,496 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-10 10:52:04,570 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:52:04,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:52:04,571 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:52:04,571 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:52:04,572 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:52:04,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:52:04,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:52:04,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:52:04,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label12_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 10:52:04,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:52:04,573 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:52:04,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:52:04,607 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-10 10:52:04,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-10 10:52:04,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:52:04,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:52:04,675 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-10 10:52:04,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-10 10:52:04,684 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-10 10:52:04,846 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:52:04,846 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:04,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:04,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:04,869 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:04,869 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:04,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:04,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:04,877 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:04,877 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:04,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:04,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:04,925 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:04,925 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:04,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:04,932 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:04,948 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:04,948 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:04,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:04,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:04,998 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:04,998 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:05,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:05,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:05,003 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:05,004 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:05,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:05,030 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:05,035 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:05,035 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:05,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:05,056 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:05,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:52:05,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:05,112 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:52:05,114 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:52:05,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:52:05,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:52:05,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:52:05,114 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:52:05,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:52:05,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:52:05,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:52:05,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label12_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 10:52:05,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:52:05,115 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:52:05,116 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-10 10:52:05,124 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-10 10:52:05,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-10 10:52:05,142 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-10 10:52:05,145 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-10 10:52:05,147 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-10 10:52:05,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:52:05,151 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-10 10:52:05,405 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-10 10:52:05,435 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:52:05,439 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:52:05,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:05,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:05,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,456 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:05,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:05,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:05,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:05,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:05,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,499 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:05,500 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,504 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 10:52:05,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,506 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,507 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,522 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,522 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,526 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,526 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,534 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:52:05,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,557 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,558 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,563 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,563 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,567 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,571 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,571 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,573 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,573 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:05,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,579 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,579 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 10:52:05,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,580 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,581 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,589 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,593 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,594 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:52:05,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,609 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,617 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,620 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,620 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,622 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,622 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,623 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:05,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,629 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 10:52:05,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,630 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,631 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,638 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,638 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,642 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,642 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,643 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 10:52:05,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,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-10 10:52:05,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,657 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,657 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,662 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,662 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,665 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,666 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,669 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,669 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:05,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,671 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,671 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,672 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:05,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,675 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 10:52:05,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-10 10:52:05,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,676 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,677 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,678 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,690 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,690 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,691 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,694 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,694 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,694 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,697 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:52:05,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,722 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,723 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,723 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,728 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,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-10 10:52:05,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,732 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,732 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,732 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,735 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,736 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,736 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:05,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,738 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,738 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:05,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:05,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,744 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 10:52:05,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,745 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,745 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,747 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,760 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,760 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,760 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,765 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,766 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,768 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:52:05,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,798 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,805 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,809 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,810 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,814 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,815 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,815 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,817 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:05,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,819 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:05,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,826 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 10:52:05,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,827 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,828 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,830 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,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-10 10:52:05,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,842 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,842 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,843 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,849 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,849 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,849 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,853 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 10:52:05,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,890 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,891 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,892 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,905 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,905 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,906 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,911 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,912 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:05,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,913 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,913 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,913 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:05,915 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:05,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,924 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 10:52:05,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,925 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,925 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,926 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,936 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,939 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,939 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:05,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,941 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:52:05,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,956 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,957 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,957 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,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-10 10:52:05,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,962 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,962 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,962 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,965 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,965 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,965 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,968 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,968 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,968 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:05,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:05,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,970 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:05,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,970 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:05,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:05,971 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:05,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:05,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:05,976 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 10:52:05,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-10 10:52:05,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:05,977 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:05,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:05,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:05,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:05,977 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:05,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:05,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:06,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:06,004 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:06,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:06,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:06,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:06,005 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:06,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:06,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:06,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:06,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:06,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:06,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:06,009 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:52:06,009 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:06,012 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 10:52:06,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:06,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:06,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:06,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:06,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:06,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:06,079 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:06,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:06,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:06,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:06,090 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:06,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:06,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:06,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:06,090 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:06,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:06,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:06,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:06,095 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:06,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:06,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:06,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:06,095 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:06,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:06,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:06,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:06,099 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:06,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:06,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:06,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:06,100 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:06,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:06,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:06,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:06,103 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:06,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:06,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:06,103 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:06,104 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:06,105 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:52:06,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:06,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:52:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:52:06,129 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 10:52:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:52:06,762 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 10:52:06,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:52:06,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 10:52:06,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 10:52:06,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 10:52:06,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 10:52:06,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 10:52:06,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 10:52:06,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:52:06,780 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 10:52:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 10:52:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 10:52:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 10:52:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 10:52:06,807 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 10:52:06,807 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 10:52:06,807 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:52:06,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 10:52:06,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 10:52:06,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:06,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:06,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:06,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:52:06,809 INFO L793 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-10 10:52:06,810 INFO L795 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 !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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 !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 886#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 760#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 761#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 947#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 945#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 944#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~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-10 10:52:06,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 10:52:06,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:06,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:06,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:06,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:06,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:06,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 10:52:06,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:06,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:06,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:52:06,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:06,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 10:52:06,825 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:06,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:52:06,875 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-10 10:52:06,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:52:06,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:52:06,948 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:52:06,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:52:06,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:52:06,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:52:06,948 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:52:06,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:52:06,948 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:52:06,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:52:06,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label12_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 10:52:06,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:52:06,948 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:52:06,950 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-10 10:52:06,953 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-10 10:52:06,956 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-10 10:52:06,958 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-10 10:52:06,959 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-10 10:52:06,961 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-10 10:52:06,965 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-10 10:52:06,970 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-10 10:52:07,061 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:52:07,061 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:07,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:07,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:07,104 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:07,104 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:07,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:07,116 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:07,119 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:07,119 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:07,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:07,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:07,139 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:07,139 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:07,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:07,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:07,159 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:07,159 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:07,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:07,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:07,203 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:07,204 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:07,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:07,212 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:07,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:52:07,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:07,279 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:52:07,281 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:52:07,281 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:52:07,281 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:52:07,281 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:52:07,281 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:52:07,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:52:07,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:52:07,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:52:07,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label12_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 10:52:07,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:52:07,281 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:52:07,283 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-10 10:52:07,286 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-10 10:52:07,289 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-10 10:52:07,291 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-10 10:52:07,292 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-10 10:52:07,294 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-10 10:52:07,297 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-10 10:52:07,305 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-10 10:52:07,389 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:52:07,389 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:52:07,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:07,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:07,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,395 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,395 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:07,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:07,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,399 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,401 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,402 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:52:07,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:52:07,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,406 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 10:52:07,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,409 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,411 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,411 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,413 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,413 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,415 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,415 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,416 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,419 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,419 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,424 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,426 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 10:52:07,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,429 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,432 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,432 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,432 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,433 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,434 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,435 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,435 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,437 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,437 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,440 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,441 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,445 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,446 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,448 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 10:52:07,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,449 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,450 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,452 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,452 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,455 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,455 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,455 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:07,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,457 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,457 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,458 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,459 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,461 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,461 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,461 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:07,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,465 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,465 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,465 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:07,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:52:07,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,470 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,471 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,474 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 10:52:07,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,474 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,477 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,478 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,478 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,482 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,483 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,484 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,484 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,485 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,486 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,488 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,488 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,488 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,493 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,493 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,493 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,493 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,500 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,500 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:52:07,501 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:52:07,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,504 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 10:52:07,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,505 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,505 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,506 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,508 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,508 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,509 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,509 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,513 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,514 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,514 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,514 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,516 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,517 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,518 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,518 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,519 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,519 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,522 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,522 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,522 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,523 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,529 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,529 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,530 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,541 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:52:07,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,541 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,549 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 10:52:07,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,550 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,550 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,550 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,551 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,556 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,556 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,557 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,558 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,565 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,566 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,567 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:07,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,569 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,570 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,570 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,572 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,572 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,573 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,574 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,579 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,579 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,579 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,581 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:07,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,592 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,592 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,592 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,595 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:52:07,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,615 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,616 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:52:07,618 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:52:07,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,627 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 10:52:07,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,628 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,631 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,631 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,631 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,635 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,636 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,636 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,636 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,638 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,644 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,650 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,650 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,650 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,651 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:52:07,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,711 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:52:07,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:52:07,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:52:07,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,722 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 10:52:07,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,722 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,723 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,726 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,727 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,737 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,737 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,738 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,738 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:52:07,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,740 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,741 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,744 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,745 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,749 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,749 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,749 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,750 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:52:07,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,764 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:52:07,765 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,766 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:52:07,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:52:07,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:52:07,796 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:52:07,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:52:07,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:52:07,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:52:07,797 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:52:07,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:52:07,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:52:07,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:52:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:52:07,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:52:07,816 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 10:52:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:52:08,318 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-10 10:52:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:52:08,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-10 10:52:08,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 10:52:08,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 10:52:08,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 10:52:08,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 10:52:08,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-10 10:52:08,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:52:08,330 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 10:52:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-10 10:52:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 10:52:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 10:52:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 10:52:08,347 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 10:52:08,347 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 10:52:08,348 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:52:08,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-10 10:52:08,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 10:52:08,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:08,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:08,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:08,352 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-10 10:52:08,352 INFO L793 eck$LassoCheckResult]: Stem: 1792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-10 10:52:08,353 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2236#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2235#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 1931#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1932#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~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; 2197#L606-3 assume true; 2196#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2194#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 2193#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2191#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2190#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2189#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2187#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2185#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2183#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2181#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2179#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2177#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2175#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2173#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2171#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2169#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2167#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2165#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2164#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2163#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2162#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2161#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2150#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2151#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2199#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2234#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2233#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2136#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2134#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2132#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2130#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2128#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2126#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2124#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2123#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2122#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2121#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2120#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2118#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2119#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2188#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2186#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2184#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2182#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2180#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2178#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2176#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2174#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2172#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1815#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-10 10:52:08,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 10:52:08,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:08,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:08,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:08,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:08,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:08,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:08,359 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 10:52:08,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:08,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:08,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:52:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:52:08,431 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-10 10:52:08,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:52:08,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:52:08,431 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:52:08,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:52:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:52:08,432 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-10 10:52:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:52:09,055 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2018-11-10 10:52:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:52:09,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1701 transitions. [2018-11-10 10:52:09,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 10:52:09,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1701 transitions. [2018-11-10 10:52:09,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 10:52:09,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 10:52:09,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1701 transitions. [2018-11-10 10:52:09,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:52:09,065 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2018-11-10 10:52:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1701 transitions. [2018-11-10 10:52:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 10:52:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 10:52:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2018-11-10 10:52:09,082 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-10 10:52:09,082 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-10 10:52:09,082 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:52:09,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1695 transitions. [2018-11-10 10:52:09,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 10:52:09,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:09,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:09,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:09,089 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-10 10:52:09,089 INFO L793 eck$LassoCheckResult]: Stem: 3693#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-10 10:52:09,089 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4514#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4512#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4510#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4508#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4506#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4504#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4502#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4325#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3785#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4303#L606-3 assume true; 4301#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4299#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4297#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3801#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4440#L606-3 assume true; 4439#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4438#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4437#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4436#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4435#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4433#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4431#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4429#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4427#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4425#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4423#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4421#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4419#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4417#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4415#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4413#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4411#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4409#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4407#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4405#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4403#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4401#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4399#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4397#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4395#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4393#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4391#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4389#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4387#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4190#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4186#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4182#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4178#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4174#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4170#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4166#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4159#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4156#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4152#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4148#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4145#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4142#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4138#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4134#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4130#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4126#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4121#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4115#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4109#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4110#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-10 10:52:09,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 10:52:09,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:09,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:09,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:09,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:09,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 10:52:09,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:09,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:09,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:52:09,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:52:09,120 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-10 10:52:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:52:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:52:09,121 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:52:09,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:52:09,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:52:09,121 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-10 10:52:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:52:09,472 INFO L93 Difference]: Finished difference Result 1509 states and 2004 transitions. [2018-11-10 10:52:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:52:09,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2004 transitions. [2018-11-10 10:52:09,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 10:52:09,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2004 transitions. [2018-11-10 10:52:09,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 10:52:09,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 10:52:09,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2004 transitions. [2018-11-10 10:52:09,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:52:09,484 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2004 transitions. [2018-11-10 10:52:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2004 transitions. [2018-11-10 10:52:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 10:52:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 10:52:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2002 transitions. [2018-11-10 10:52:09,497 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-10 10:52:09,497 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-10 10:52:09,497 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:52:09,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2002 transitions. [2018-11-10 10:52:09,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 10:52:09,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:09,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:09,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:09,503 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-10 10:52:09,503 INFO L793 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-10 10:52:09,503 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7529#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7527#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 7521#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7520#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7518#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7516#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7514#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7512#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7510#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7508#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7506#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7504#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7502#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7500#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7498#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7496#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7494#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7492#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6542#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6912#L606-3 assume true; 6910#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6908#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 6906#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6730#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7301#L606-3 assume true; 7299#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7297#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 7295#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7293#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7291#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7289#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7287#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7285#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7283#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7281#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7279#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7277#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7275#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7274#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7273#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7271#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7269#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7267#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 7265#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 7263#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7261#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 7259#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7257#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7255#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 7253#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7251#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 7249#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 7247#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7245#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7243#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7241#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7239#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 7237#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7235#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7233#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7231#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 7229#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7227#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7225#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 7223#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7221#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 7219#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 7217#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7215#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 7213#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7211#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7209#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 7207#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 7204#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 7205#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-10 10:52:09,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 10:52:09,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:09,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 10:52:09,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:09,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:09,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:52:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:52:09,537 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-10 10:52:09,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:52:09,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:52:09,538 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:52:09,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:52:09,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:52:09,538 INFO L87 Difference]: Start difference. First operand 1508 states and 2002 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-10 10:52:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:52:09,884 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-10 10:52:09,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:52:09,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-10 10:52:09,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 10:52:09,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 10:52:09,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 10:52:09,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 10:52:09,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-10 10:52:09,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:52:09,901 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 10:52:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-10 10:52:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 10:52:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 10:52:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 10:52:09,919 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 10:52:09,919 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 10:52:09,919 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:52:09,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-10 10:52:09,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 10:52:09,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:09,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:09,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:09,925 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-10 10:52:09,926 INFO L793 eck$LassoCheckResult]: Stem: 9449#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-10 10:52:09,926 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10443#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10441#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 10439#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10154#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10155#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10457#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10454#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10197#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10198#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10192#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10193#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10467#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10464#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10201#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10189#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10188#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10186#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 10184#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 10182#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10180#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10178#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10176#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10174#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10172#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10170#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10168#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10166#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10164#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 10162#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9673#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9775#L606-3 assume true; 9773#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9771#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9769#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9767#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9765#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9763#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9761#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9759#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9757#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9755#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9753#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9751#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9749#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9747#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9745#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9743#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9741#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9739#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9737#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9735#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9733#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9731#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9729#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9727#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9725#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9723#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9721#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9718#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9716#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9714#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9712#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9710#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9708#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9706#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9704#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9702#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9700#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9698#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9696#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9694#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9692#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9690#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9688#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9686#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9684#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9682#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9680#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9678#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9675#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9676#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-10 10:52:09,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 10:52:09,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:09,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:09,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:09,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 10:52:09,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:09,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:52:09,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:52:10,017 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-10 10:52:10,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:52:10,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:52:10,017 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:52:10,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:52:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:52:10,018 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-10 10:52:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:52:10,243 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-10 10:52:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:52:10,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-10 10:52:10,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 10:52:10,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 10:52:10,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 10:52:10,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 10:52:10,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-10 10:52:10,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:52:10,258 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 10:52:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-10 10:52:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 10:52:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 10:52:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 10:52:10,275 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 10:52:10,275 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 10:52:10,275 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:52:10,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-10 10:52:10,280 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 10:52:10,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:10,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:10,281 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:52:10,281 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-10 10:52:10,281 INFO L793 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-10 10:52:10,282 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13353#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13352#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 13350#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13349#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13348#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13347#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13345#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13343#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13338#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13337#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13335#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13333#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13331#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13329#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13327#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13325#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13323#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13321#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13319#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13317#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13315#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13313#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13311#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13309#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13307#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13305#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13303#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13301#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13299#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13297#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13295#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13293#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13291#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13289#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13287#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13285#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13283#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13281#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13279#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13277#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13275#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13273#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13271#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13269#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13267#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13265#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13263#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13261#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13259#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13257#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13255#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13253#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13251#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13249#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13247#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13245#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13243#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13241#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13239#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13237#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13235#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13233#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13231#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13229#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13227#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13225#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13223#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13221#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13219#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13217#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13215#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13213#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13211#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13209#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13207#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13205#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13203#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13201#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13199#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13197#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13195#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13193#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13191#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13189#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13187#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13185#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12355#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13182#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13180#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13178#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13176#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13174#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13172#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13170#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13168#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13166#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13163#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13161#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13159#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13157#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13155#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13153#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13151#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13148#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13146#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13145#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13144#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13142#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13140#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13138#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13137#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13136#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12488#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13408#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13406#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13404#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13402#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13400#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13398#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13396#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13394#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13392#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13390#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13388#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13386#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13384#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13382#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13380#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13378#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13376#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13374#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13372#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13370#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13368#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13366#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13364#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13362#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13360#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13358#L594-1 calculate_output_#res := -2; 13356#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-10 10:52:10,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 10:52:10,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:10,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 10:52:10,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:10,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:10,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:10,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:10,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 10:52:10,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:10,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:10,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:10,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:52:10,799 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-10 10:52:10,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:52:10,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:52:11,558 WARN L179 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 10:52:11,675 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-10 10:52:11,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:52:11,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:52:11,678 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-10 10:52:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:52:12,420 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-10 10:52:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:52:12,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-10 10:52:12,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 10:52:12,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-10 10:52:12,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 10:52:12,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 10:52:12,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-10 10:52:12,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:52:12,435 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-10 10:52:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-10 10:52:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 10:52:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 10:52:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-10 10:52:12,454 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 10:52:12,454 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 10:52:12,454 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:52:12,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-10 10:52:12,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 10:52:12,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:52:12,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:52:12,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:52:12,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:52:12,459 INFO L793 eck$LassoCheckResult]: Stem: 15665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16995#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16992#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 16989#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16301#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15814#L597 [2018-11-10 10:52:12,460 INFO L795 eck$LassoCheckResult]: Loop: 15814#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16277#L606-3 assume true; 16275#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16273#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 16271#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16269#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16267#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16265#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16263#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15814#L597 [2018-11-10 10:52:12,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 10:52:12,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:12,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:12,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:12,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:12,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:12,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 10:52:12,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:12,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:12,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:12,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:12,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:12,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:52:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 10:52:12,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:52:12,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:52:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:12,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:52:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:52:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:52:12,646 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:52:12,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:52:12,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:52:12,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:52:12,647 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:52:12,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:52:12,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:52:12,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:52:12,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label12_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 10:52:12,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:52:12,647 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:52:12,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-10 10:52:12,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-10 10:52:12,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-10 10:52:12,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:52:12,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-10 10:52:12,661 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-10 10:52:12,662 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-10 10:52:12,664 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-10 10:52:12,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:52:12,667 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-10 10:52:12,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-10 10:52:12,670 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-10 10:52:12,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:52:12,673 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-10 10:52:12,676 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-10 10:52:12,679 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-10 10:52:12,687 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-10 10:52:12,690 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-10 10:52:12,696 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-10 10:52:12,699 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-10 10:52:12,702 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-10 10:52:12,817 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:52:12,817 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,824 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,824 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,857 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,857 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,863 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,863 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,882 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,882 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,900 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,900 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,934 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,934 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,936 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,937 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,939 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,939 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,971 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,971 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,990 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,990 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:12,993 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:12,993 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:12,995 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:12,995 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,027 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,028 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,047 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,047 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,055 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,055 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,073 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,073 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,105 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,105 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,108 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:52:13,128 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,326 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,326 INFO L446 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=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,346 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,346 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,373 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,395 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:52:13,395 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,544 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,544 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,576 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,576 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,581 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,581 INFO L446 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_d3904732-07a9-4c07-833e-59c738654de9/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-10 10:52:13,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:52:13,598 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:52:13,600 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:52:13,600 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 10:52:13,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:52:13 BoogieIcfgContainer [2018-11-10 10:52:13,635 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:52:13,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:52:13,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:52:13,636 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:52:13,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:52:04" (3/4) ... [2018-11-10 10:52:13,639 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 10:52:13,671 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d3904732-07a9-4c07-833e-59c738654de9/bin-2019/uautomizer/witness.graphml [2018-11-10 10:52:13,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:52:13,672 INFO L168 Benchmark]: Toolchain (without parser) took 10928.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.5 MB). Free memory was 955.5 MB in the beginning and 1.4 GB in the end (delta: -454.0 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:52:13,673 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:52:13,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.45 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 920.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:52:13,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -206.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:52:13,673 INFO L168 Benchmark]: Boogie Preprocessor took 42.17 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:52:13,674 INFO L168 Benchmark]: RCFGBuilder took 857.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:52:13,674 INFO L168 Benchmark]: BuchiAutomizer took 9532.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.8 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -393.0 MB). Peak memory consumption was 503.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:52:13,674 INFO L168 Benchmark]: Witness Printer took 35.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 301.3 kB). Peak memory consumption was 301.3 kB. Max. memory is 11.5 GB. [2018-11-10 10:52:13,676 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.45 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 920.6 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 112.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -206.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.17 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 857.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9532.99 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.8 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -393.0 MB). Peak memory consumption was 503.0 MB. Max. memory is 11.5 GB. * Witness Printer took 35.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 301.3 kB). Peak memory consumption was 301.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.7s. Construction of modules took 2.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 69ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - 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@56e0faa1=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c3d5f12=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@56e0faa1=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c3d5f12=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@56e0faa1=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@2c3d5f12=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 4 + -4*0^k + -4*k + -5*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 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 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...