./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label22.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03d2eba0c96e405e42abc242d8ae37d66c66f111 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:21:40,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:21:40,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:21:40,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:21:40,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:21:40,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:21:40,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:21:40,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:21:40,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:21:40,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:21:40,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:21:40,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:21:40,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:21:40,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:21:40,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:21:40,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:21:40,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:21:40,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:21:40,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:21:40,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:21:40,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:21:40,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:21:40,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:21:40,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:21:40,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:21:40,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:21:40,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:21:40,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:21:40,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:21:40,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:21:40,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:21:40,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:21:40,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:21:40,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:21:40,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:21:40,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:21:40,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:21:40,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:21:40,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:21:40,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:21:40,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:21:40,489 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:21:40,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:21:40,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:21:40,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:21:40,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:21:40,527 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:21:40,527 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:21:40,527 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:21:40,527 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:21:40,528 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:21:40,528 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:21:40,528 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:21:40,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:21:40,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:21:40,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:21:40,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:21:40,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:21:40,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:21:40,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:21:40,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:21:40,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:21:40,530 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:21:40,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:21:40,530 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:21:40,530 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:21:40,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:21:40,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:21:40,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:21:40,531 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:21:40,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:21:40,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:21:40,532 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:21:40,533 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:21:40,533 INFO L138 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03d2eba0c96e405e42abc242d8ae37d66c66f111 [2019-11-16 00:21:40,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:21:40,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:21:40,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:21:40,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:21:40,572 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:21:40,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2019-11-16 00:21:40,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/data/b24b638b3/f491a90528aa47a9ad33adf624ccb969/FLAG3904cdca3 [2019-11-16 00:21:41,141 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:21:41,154 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2019-11-16 00:21:41,172 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/data/b24b638b3/f491a90528aa47a9ad33adf624ccb969/FLAG3904cdca3 [2019-11-16 00:21:41,643 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/data/b24b638b3/f491a90528aa47a9ad33adf624ccb969 [2019-11-16 00:21:41,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:21:41,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:21:41,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:41,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:21:41,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:21:41,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:41" (1/1) ... [2019-11-16 00:21:41,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2e0d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:41, skipping insertion in model container [2019-11-16 00:21:41,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:41" (1/1) ... [2019-11-16 00:21:41,673 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:21:41,722 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:21:42,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:42,165 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:21:42,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:42,306 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:21:42,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42 WrapperNode [2019-11-16 00:21:42,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:42,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:42,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:21:42,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:21:42,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:42,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:21:42,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:21:42,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:21:42,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... [2019-11-16 00:21:42,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:21:42,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:21:42,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:21:42,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:21:42,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:21:42,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:21:44,201 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:21:44,201 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:21:44,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:44 BoogieIcfgContainer [2019-11-16 00:21:44,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:21:44,204 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:21:44,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:21:44,209 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:21:44,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:21:44,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:21:41" (1/3) ... [2019-11-16 00:21:44,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cddee92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:21:44, skipping insertion in model container [2019-11-16 00:21:44,213 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:21:44,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:42" (2/3) ... [2019-11-16 00:21:44,214 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cddee92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:21:44, skipping insertion in model container [2019-11-16 00:21:44,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:21:44,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:44" (3/3) ... [2019-11-16 00:21:44,216 INFO L371 chiAutomizerObserver]: Analyzing ICFG Problem02_label22.c [2019-11-16 00:21:44,269 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:21:44,269 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:21:44,269 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:21:44,270 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:21:44,270 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:21:44,270 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:21:44,270 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:21:44,270 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:21:44,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-11-16 00:21:44,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-11-16 00:21:44,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:44,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:44,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:44,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:21:44,343 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:21:44,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-11-16 00:21:44,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-11-16 00:21:44,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:44,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:44,355 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:44,355 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:21:44,363 INFO L791 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2019-11-16 00:21:44,364 INFO L793 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2019-11-16 00:21:44,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:21:44,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:44,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540365073] [2019-11-16 00:21:44,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:44,487 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:44,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-11-16 00:21:44,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:44,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368668485] [2019-11-16 00:21:44,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:44,520 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-11-16 00:21:44,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:44,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828854791] [2019-11-16 00:21:44,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:44,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:44,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828854791] [2019-11-16 00:21:44,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:44,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:21:44,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896073935] [2019-11-16 00:21:44,724 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-11-16 00:21:44,794 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:21:44,795 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:21:44,795 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:21:44,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:21:44,796 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:21:44,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:44,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:21:44,796 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:21:44,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22.c_Iteration1_Loop [2019-11-16 00:21:44,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:21:44,797 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:21:44,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:44,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,289 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-16 00:21:45,378 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:21:45,379 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:45,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:45,405 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:45,405 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:45,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,419 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:45,429 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:45,430 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:45,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:45,458 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:45,458 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:45,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,487 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:45,493 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:45,493 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:45,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:45,550 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:45,550 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:45,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:45,570 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:45,571 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:45,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:45,594 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:45,594 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:45,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:45,609 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:45,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:21:45,637 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:45,659 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:21:45,662 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:21:45,662 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:21:45,662 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:21:45,662 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:21:45,662 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:21:45,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:45,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:21:45,663 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:21:45,663 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22.c_Iteration1_Loop [2019-11-16 00:21:45,663 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:21:45,664 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:21:45,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:45,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:46,063 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-16 00:21:46,115 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:21:46,120 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:21:46,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,174 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:46,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,177 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,223 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,223 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,223 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,223 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,224 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,224 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,252 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,260 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,261 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:46,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,265 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:46,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:46,267 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,281 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-16 00:21:46,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,283 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,286 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,287 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,307 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,309 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,310 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,310 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,315 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:46,315 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,318 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:21:46,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,358 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,358 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,375 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,376 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,376 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,382 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,382 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,383 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,399 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,399 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,401 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:46,401 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,401 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,401 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,407 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-16 00:21:46,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,409 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,410 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,418 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,418 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,419 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,419 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,423 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:46,423 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,425 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:21:46,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,449 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,449 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,454 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,455 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,455 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,455 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,459 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,459 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,459 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,460 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,460 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,472 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,472 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,473 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,473 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,476 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,477 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:46,477 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,478 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:46,478 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,487 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-16 00:21:46,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,488 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,488 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,488 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,493 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,494 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,511 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,512 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,512 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,520 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,520 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:46,520 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,530 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-16 00:21:46,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,547 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,547 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,548 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,548 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,549 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,554 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,554 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,558 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,558 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,558 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,562 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,562 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,562 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,563 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,563 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:46,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,565 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:46,565 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,566 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:46,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,572 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-16 00:21:46,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,573 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,573 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,573 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,574 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,575 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,575 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,589 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,589 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,589 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,589 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,590 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,601 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,601 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,602 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:46,602 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,604 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-16 00:21:46,605 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,642 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,642 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,643 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,643 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,649 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,649 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,650 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,651 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,654 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,654 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,655 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,656 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,659 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,660 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,660 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,660 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:46,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,662 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,662 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:46,662 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,662 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:46,663 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:46,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:46,664 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,669 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-16 00:21:46,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,670 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,670 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,671 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,673 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,691 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,691 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,692 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,693 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,698 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,698 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,698 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,698 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:46,699 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,702 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:21:46,703 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,797 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,797 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,797 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,798 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,798 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,800 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,807 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,808 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,808 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,809 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,816 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,816 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,817 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,818 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,825 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,825 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,825 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,826 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:46,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,829 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,829 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:46,829 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,830 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:46,830 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:46,831 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:46,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,847 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-16 00:21:46,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,848 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,849 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:46,849 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,850 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,852 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,869 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,869 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:46,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:46,870 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,872 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:46,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:46,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:46,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:46,881 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:46,882 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:46,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:46,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:46,882 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:46,882 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:46,897 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-16 00:21:46,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,113 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,113 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,114 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:47,118 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:47,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,142 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,143 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,144 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:47,145 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:47,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,172 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,172 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,172 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:47,173 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:47,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,179 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,179 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,180 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:47,181 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:47,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,183 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,183 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,184 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:47,193 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:47,196 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:47,196 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,214 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-16 00:21:47,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,216 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,216 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,216 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,217 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,218 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:47,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,234 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,234 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,235 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,235 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:47,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,239 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,239 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,240 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:47,240 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,241 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:21:47,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,287 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,287 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,288 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,289 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:47,289 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,296 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,296 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,296 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,297 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,297 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:47,297 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,300 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,300 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,301 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,301 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:47,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,304 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,305 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,305 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,305 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,305 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,306 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:47,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,308 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,308 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:47,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,309 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:47,309 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:47,310 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:47,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,321 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-16 00:21:47,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,322 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,322 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,323 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,324 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:47,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,449 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,449 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,450 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,451 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:47,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,455 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,456 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,456 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,456 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-16 00:21:47,456 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,459 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-11-16 00:21:47,460 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,596 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,597 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,597 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,599 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:47,599 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,610 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,610 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,611 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,612 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:47,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,618 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,618 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,619 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:47,620 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,625 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,625 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:47,626 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:47,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:47,631 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:47,631 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:47,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:47,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:47,632 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:47,632 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:47,634 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:21:47,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:47,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:47,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:47,662 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-11-16 00:21:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:48,707 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2019-11-16 00:21:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:48,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 489 transitions. [2019-11-16 00:21:48,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2019-11-16 00:21:48,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 307 states and 409 transitions. [2019-11-16 00:21:48,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2019-11-16 00:21:48,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2019-11-16 00:21:48,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 409 transitions. [2019-11-16 00:21:48,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:48,730 INFO L688 BuchiCegarLoop]: Abstraction has 307 states and 409 transitions. [2019-11-16 00:21:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 409 transitions. [2019-11-16 00:21:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-11-16 00:21:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-16 00:21:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-11-16 00:21:48,771 INFO L711 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-11-16 00:21:48,772 INFO L591 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-11-16 00:21:48,772 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:21:48,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-11-16 00:21:48,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-11-16 00:21:48,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:48,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:48,780 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:48,780 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:48,780 INFO L791 eck$LassoCheckResult]: Stem: 765#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 630#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 631#L606-2 [2019-11-16 00:21:48,781 INFO L793 eck$LassoCheckResult]: Loop: 631#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 720#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 756#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 760#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 776#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 712#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 713#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 705#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 631#L606-2 [2019-11-16 00:21:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-16 00:21:48,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:48,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410964760] [2019-11-16 00:21:48,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:48,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:48,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:48,789 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-11-16 00:21:48,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:48,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003729030] [2019-11-16 00:21:48,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:48,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:48,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:48,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-11-16 00:21:48,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:48,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153901408] [2019-11-16 00:21:48,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:48,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:48,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:48,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153901408] [2019-11-16 00:21:48,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:48,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:21:48,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153900682] [2019-11-16 00:21:48,944 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-11-16 00:21:48,979 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:21:48,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:21:48,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:21:48,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:21:48,979 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:21:48,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:48,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:21:48,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:21:48,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22.c_Iteration2_Loop [2019-11-16 00:21:48,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:21:48,980 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:21:48,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:48,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:48,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:48,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:48,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,194 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:21:49,194 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:49,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:49,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:49,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:49,215 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:49,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:49,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:49,239 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:49,240 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:49,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:49,251 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:49,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:49,256 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:49,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:49,273 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:49,279 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:49,279 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:49,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:49,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:49,318 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:21:49,318 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:21:49,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:21:49,342 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:21:49,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:21:49,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:21:49,382 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:21:49,384 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:21:49,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:21:49,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:21:49,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:21:49,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:21:49,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:21:49,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:21:49,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:21:49,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22.c_Iteration2_Loop [2019-11-16 00:21:49,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:21:49,386 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:21:49,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:21:49,742 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:21:49,742 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:21:49,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:49,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,745 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,746 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,746 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,746 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,747 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,748 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:49,748 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:49,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,755 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,756 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,758 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,759 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:49,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:21:49,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:21:49,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,770 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-16 00:21:49,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,771 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,772 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,774 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,775 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,775 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:49,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,777 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,778 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,780 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,780 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,783 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,783 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,783 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:49,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,787 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,787 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,787 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:49,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,792 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,793 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,793 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,793 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,806 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,807 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,807 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,809 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-16 00:21:49,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,810 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,811 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,814 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,814 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,814 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,815 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:49,815 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,820 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,820 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,822 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,822 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,823 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,823 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,827 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,827 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,827 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:49,827 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,831 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,831 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,836 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:49,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,843 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,844 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,849 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,849 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,850 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,852 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-16 00:21:49,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,853 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,854 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:49,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,857 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,858 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,858 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:49,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,861 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,861 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:49,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,865 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,866 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:49,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,869 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,869 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,869 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:49,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,874 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,875 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,875 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,876 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:49,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,883 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,884 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:49,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:21:49,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,890 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:49,891 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:49,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,893 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-16 00:21:49,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,895 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,895 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,896 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,896 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,900 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,900 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,900 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,901 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,901 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:49,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,905 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,905 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,906 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,906 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,906 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,910 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,910 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,910 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,911 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,911 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,914 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,914 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,915 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,915 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,915 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,916 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:49,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,922 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,922 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,922 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,923 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,924 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:49,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,934 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,934 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,934 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,935 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,936 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,944 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,944 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:49,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,945 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-16 00:21:49,946 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-16 00:21:49,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,949 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-16 00:21:49,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,949 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,950 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:49,950 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,950 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,951 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,957 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,957 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:49,957 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,957 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,958 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,959 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:49,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,961 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,961 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:49,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,962 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,963 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,963 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,965 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,965 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:49,966 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:49,966 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,967 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:49,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,972 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,972 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:49,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,973 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,973 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,975 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:49,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:49,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:49,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:49,984 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:49,984 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:49,984 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:49,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:49,985 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:49,985 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:49,987 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:49,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,009 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,010 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:50,010 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,010 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,012 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:50,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,023 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,023 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-16 00:21:50,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,024 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,024 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,024 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,025 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:50,025 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,031 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-16 00:21:50,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,033 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,033 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,033 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,033 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,035 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:50,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,061 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,061 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,062 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,062 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,063 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:50,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,065 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,066 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,066 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,066 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,067 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:50,067 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,071 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,071 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,072 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,073 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:50,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,079 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,079 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,079 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,080 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,082 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:50,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,097 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,097 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,098 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,098 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,098 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,102 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-16 00:21:50,102 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,125 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,125 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,126 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,134 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:50,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,145 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,146 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,147 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-16 00:21:50,148 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-16 00:21:50,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,155 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-16 00:21:50,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,156 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,156 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,156 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,157 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:50,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,160 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,160 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,160 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,161 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,161 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,161 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:50,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,164 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,164 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,165 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,165 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:50,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,168 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,168 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,168 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,169 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:50,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,171 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,172 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,172 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,172 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,173 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:50,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,180 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,180 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,181 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,181 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,182 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:21:50,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,191 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,191 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,192 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,193 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:50,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,204 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,204 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-16 00:21:50,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,205 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-16 00:21:50,205 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:21:50,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,209 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-16 00:21:50,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,210 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,210 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,211 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,211 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,212 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:50,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,216 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,216 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,216 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,217 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,217 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,228 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:21:50,228 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,231 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,231 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,232 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,232 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:50,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,236 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,237 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,237 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,238 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:50,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,241 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,242 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,242 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,242 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,242 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,243 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:21:50,244 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,265 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,266 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,266 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:21:50,266 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,268 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:21:50,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,321 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,321 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,322 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,324 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:50,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:21:50,358 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-16 00:21:50,358 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-16 00:21:50,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:21:50,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:21:50,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:21:50,359 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-16 00:21:50,360 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:21:50,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:21:50,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:21:50,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:50,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:50,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:50,372 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-11-16 00:21:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:50,994 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-11-16 00:21:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:50,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-11-16 00:21:51,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-11-16 00:21:51,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-11-16 00:21:51,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-11-16 00:21:51,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-11-16 00:21:51,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-11-16 00:21:51,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:51,013 INFO L688 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-11-16 00:21:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-11-16 00:21:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-11-16 00:21:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-16 00:21:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-11-16 00:21:51,041 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-11-16 00:21:51,042 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-11-16 00:21:51,042 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:21:51,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-11-16 00:21:51,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-11-16 00:21:51,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:51,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:51,049 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:51,049 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-11-16 00:21:51,049 INFO L791 eck$LassoCheckResult]: Stem: 1676#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1534#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1535#L606-2 [2019-11-16 00:21:51,050 INFO L793 eck$LassoCheckResult]: Loop: 1535#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2015#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2014#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2013#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1531#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1626#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1662#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1669#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1688#L38 assume 1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := 22; 1567#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1535#L606-2 [2019-11-16 00:21:51,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:51,050 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-16 00:21:51,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:51,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989915406] [2019-11-16 00:21:51,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:51,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1689438932, now seen corresponding path program 1 times [2019-11-16 00:21:51,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:51,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699678769] [2019-11-16 00:21:51,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:51,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699678769] [2019-11-16 00:21:51,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:51,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:51,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261445524] [2019-11-16 00:21:51,084 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:51,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:51,085 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-11-16 00:21:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:51,771 INFO L93 Difference]: Finished difference Result 1149 states and 1416 transitions. [2019-11-16 00:21:51,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:51,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1149 states and 1416 transitions. [2019-11-16 00:21:51,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-11-16 00:21:51,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-11-16 00:21:51,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1149 [2019-11-16 00:21:51,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1149 [2019-11-16 00:21:51,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1416 transitions. [2019-11-16 00:21:51,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:51,798 INFO L688 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-11-16 00:21:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1416 transitions. [2019-11-16 00:21:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-11-16 00:21:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-11-16 00:21:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-11-16 00:21:51,831 INFO L711 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-11-16 00:21:51,831 INFO L591 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-11-16 00:21:51,831 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:21:51,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1416 transitions. [2019-11-16 00:21:51,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-11-16 00:21:51,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:51,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:51,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:51,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 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] [2019-11-16 00:21:51,842 INFO L791 eck$LassoCheckResult]: Stem: 3407#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3278#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3279#L606-2 [2019-11-16 00:21:51,843 INFO L793 eck$LassoCheckResult]: Loop: 3279#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3366#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3399#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3402#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 3275#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3645#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3642#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3639#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3636#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3633#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3630#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3627#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3624#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3621#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3618#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3615#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3612#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3609#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3606#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3602#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3599#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3596#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 3560#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3644#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3641#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3638#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3635#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3632#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3629#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3626#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3623#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3620#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3617#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3614#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3611#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3608#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3604#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3601#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3598#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3595#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3592#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3589#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3586#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3583#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3580#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3577#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3573#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3570#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3567#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3564#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 3421#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3279#L606-2 [2019-11-16 00:21:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-16 00:21:51,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:51,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151510056] [2019-11-16 00:21:51,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:51,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:51,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1352924138, now seen corresponding path program 1 times [2019-11-16 00:21:51,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:51,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171264885] [2019-11-16 00:21:51,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:51,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:21:51,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171264885] [2019-11-16 00:21:51,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:51,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:51,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831984974] [2019-11-16 00:21:51,887 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:51,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:51,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:51,888 INFO L87 Difference]: Start difference. First operand 1149 states and 1416 transitions. cyclomatic complexity: 268 Second operand 3 states. [2019-11-16 00:21:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:52,638 INFO L93 Difference]: Finished difference Result 1996 states and 2450 transitions. [2019-11-16 00:21:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:52,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 2450 transitions. [2019-11-16 00:21:52,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1994 [2019-11-16 00:21:52,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1996 states and 2450 transitions. [2019-11-16 00:21:52,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1996 [2019-11-16 00:21:52,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1996 [2019-11-16 00:21:52,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1996 states and 2450 transitions. [2019-11-16 00:21:52,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:52,681 INFO L688 BuchiCegarLoop]: Abstraction has 1996 states and 2450 transitions. [2019-11-16 00:21:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states and 2450 transitions. [2019-11-16 00:21:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1710. [2019-11-16 00:21:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-16 00:21:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2146 transitions. [2019-11-16 00:21:52,720 INFO L711 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-11-16 00:21:52,720 INFO L591 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-11-16 00:21:52,720 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:21:52,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1710 states and 2146 transitions. [2019-11-16 00:21:52,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1708 [2019-11-16 00:21:52,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:52,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:52,734 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:52,734 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:52,734 INFO L791 eck$LassoCheckResult]: Stem: 6571#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6430#L606-2 [2019-11-16 00:21:52,734 INFO L793 eck$LassoCheckResult]: Loop: 6430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6521#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6563#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6566#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6582#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6513#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6514#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6506#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 6443#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6994#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6992#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6990#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6988#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6986#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6984#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6982#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6980#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6978#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6976#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6974#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6972#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6970#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6968#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6966#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6964#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6962#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 6879#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7193#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7188#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7183#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 7178#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7173#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7168#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7164#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7160#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7155#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 7150#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 7145#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 7140#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 7135#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7129#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7124#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7118#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7112#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7106#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 7100#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6937#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6806#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6801#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6795#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6789#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6783#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6776#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6775#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 6587#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6430#L606-2 [2019-11-16 00:21:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-11-16 00:21:52,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:52,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412767998] [2019-11-16 00:21:52,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:52,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:52,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:52,742 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:52,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash -879392628, now seen corresponding path program 1 times [2019-11-16 00:21:52,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:52,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634721189] [2019-11-16 00:21:52,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:52,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:52,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:21:52,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634721189] [2019-11-16 00:21:52,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:52,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:52,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105829197] [2019-11-16 00:21:52,784 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:52,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:52,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:52,785 INFO L87 Difference]: Start difference. First operand 1710 states and 2146 transitions. cyclomatic complexity: 437 Second operand 3 states. [2019-11-16 00:21:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:53,494 INFO L93 Difference]: Finished difference Result 1709 states and 1964 transitions. [2019-11-16 00:21:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:53,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1709 states and 1964 transitions. [2019-11-16 00:21:53,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1707 [2019-11-16 00:21:53,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1709 states to 1709 states and 1964 transitions. [2019-11-16 00:21:53,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2019-11-16 00:21:53,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2019-11-16 00:21:53,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1709 states and 1964 transitions. [2019-11-16 00:21:53,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:53,526 INFO L688 BuchiCegarLoop]: Abstraction has 1709 states and 1964 transitions. [2019-11-16 00:21:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states and 1964 transitions. [2019-11-16 00:21:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1429. [2019-11-16 00:21:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-11-16 00:21:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1654 transitions. [2019-11-16 00:21:53,554 INFO L711 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-11-16 00:21:53,554 INFO L591 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-11-16 00:21:53,554 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:21:53,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1429 states and 1654 transitions. [2019-11-16 00:21:53,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1427 [2019-11-16 00:21:53,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:53,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:53,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:53,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 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] [2019-11-16 00:21:53,564 INFO L791 eck$LassoCheckResult]: Stem: 9998#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9854#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9855#L606-2 [2019-11-16 00:21:53,564 INFO L793 eck$LassoCheckResult]: Loop: 9855#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10437#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10431#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10415#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 9851#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10406#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10404#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10402#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 9925#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 11190#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9985#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9986#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11076#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11077#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9940#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9941#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9934#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9857#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9858#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9859#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9860#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9960#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10012#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9961#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9879#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9880#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10001#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 9932#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10320#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10318#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10316#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10314#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10261#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 10257#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10252#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 10247#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10242#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10237#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 10232#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 10227#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 10222#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10215#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 10212#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10209#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10206#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10203#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 10200#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 10196#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10192#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 10188#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10184#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10180#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 10176#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10172#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 10168#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 10134#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9855#L606-2 [2019-11-16 00:21:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-11-16 00:21:53,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:53,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236596655] [2019-11-16 00:21:53,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:53,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:53,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:53,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash 274284660, now seen corresponding path program 1 times [2019-11-16 00:21:53,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:53,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451600483] [2019-11-16 00:21:53,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:53,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:53,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:21:53,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451600483] [2019-11-16 00:21:53,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:53,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:53,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948317591] [2019-11-16 00:21:53,625 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:53,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:53,625 INFO L87 Difference]: Start difference. First operand 1429 states and 1654 transitions. cyclomatic complexity: 226 Second operand 3 states. [2019-11-16 00:21:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:54,285 INFO L93 Difference]: Finished difference Result 1851 states and 2102 transitions. [2019-11-16 00:21:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:54,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1851 states and 2102 transitions. [2019-11-16 00:21:54,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1846 [2019-11-16 00:21:54,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1851 states to 1851 states and 2102 transitions. [2019-11-16 00:21:54,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1851 [2019-11-16 00:21:54,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1851 [2019-11-16 00:21:54,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1851 states and 2102 transitions. [2019-11-16 00:21:54,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:54,318 INFO L688 BuchiCegarLoop]: Abstraction has 1851 states and 2102 transitions. [2019-11-16 00:21:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 2102 transitions. [2019-11-16 00:21:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1849. [2019-11-16 00:21:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-11-16 00:21:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2099 transitions. [2019-11-16 00:21:54,348 INFO L711 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-11-16 00:21:54,349 INFO L591 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-11-16 00:21:54,349 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:21:54,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1849 states and 2099 transitions. [2019-11-16 00:21:54,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1844 [2019-11-16 00:21:54,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:54,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:54,362 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:54,362 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:54,363 INFO L791 eck$LassoCheckResult]: Stem: 13279#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13141#L606-2 [2019-11-16 00:21:54,364 INFO L793 eck$LassoCheckResult]: Loop: 13141#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14669#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14667#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14665#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14663#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 14661#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14659#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 14614#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 13154#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13488#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13486#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13484#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 13337#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 14108#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14106#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14104#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14102#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14099#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 14100#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14136#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 14134#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 14132#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13511#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 13512#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 14445#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 14443#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 14020#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 14019#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 14017#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 14015#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 14013#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 14011#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 14009#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 14007#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 14005#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 14003#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 14001#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 13999#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13997#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 13995#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 13993#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13991#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13989#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13987#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13985#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 13977#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13973#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13969#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13965#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 13961#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13957#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13953#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13949#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13945#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13941#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 13937#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13933#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 13929#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13764#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13765#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 13664#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 13665#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 13394#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13141#L606-2 [2019-11-16 00:21:54,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:54,365 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-11-16 00:21:54,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:54,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70604910] [2019-11-16 00:21:54,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:54,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:54,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:54,373 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-11-16 00:21:54,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:54,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977783759] [2019-11-16 00:21:54,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:54,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:54,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:21:54,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977783759] [2019-11-16 00:21:54,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:54,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:54,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175292996] [2019-11-16 00:21:54,420 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:54,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:54,421 INFO L87 Difference]: Start difference. First operand 1849 states and 2099 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-11-16 00:21:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:55,088 INFO L93 Difference]: Finished difference Result 1989 states and 2244 transitions. [2019-11-16 00:21:55,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:55,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1989 states and 2244 transitions. [2019-11-16 00:21:55,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-11-16 00:21:55,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-11-16 00:21:55,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1989 [2019-11-16 00:21:55,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1989 [2019-11-16 00:21:55,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1989 states and 2244 transitions. [2019-11-16 00:21:55,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:55,121 INFO L688 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-11-16 00:21:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states and 2244 transitions. [2019-11-16 00:21:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2019-11-16 00:21:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-16 00:21:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-11-16 00:21:55,155 INFO L711 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-11-16 00:21:55,155 INFO L591 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-11-16 00:21:55,155 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:21:55,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1989 states and 2244 transitions. [2019-11-16 00:21:55,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-11-16 00:21:55,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:55,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:55,168 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:55,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:55,168 INFO L791 eck$LassoCheckResult]: Stem: 17120#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 16984#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 16985#L606-2 [2019-11-16 00:21:55,169 INFO L793 eck$LassoCheckResult]: Loop: 16985#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17073#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 17110#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 17114#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 16983#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 18289#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 18287#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 18285#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 18283#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 18281#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 18279#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18277#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 18275#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 18273#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 18271#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 18269#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 18267#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 18265#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 18263#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 18261#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 18259#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 18257#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 18255#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 18253#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 18251#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 18249#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 18247#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 18245#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 18243#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 18241#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 18239#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 18237#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 18235#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 18233#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 18220#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 18221#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 18497#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 18493#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 18488#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18482#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 17321#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 17322#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 18494#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 18489#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 18483#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 17323#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 17324#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 18333#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 18331#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 18329#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 18327#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 18325#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 18323#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 18321#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 18319#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 18317#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 18315#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 18313#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 18292#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 18293#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 18463#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 18462#L293 assume (1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := -1; 17133#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16985#L606-2 [2019-11-16 00:21:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-11-16 00:21:55,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:55,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228087249] [2019-11-16 00:21:55,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:55,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:55,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:55,181 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1740840234, now seen corresponding path program 1 times [2019-11-16 00:21:55,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:55,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169845518] [2019-11-16 00:21:55,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:55,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:55,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:55,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169845518] [2019-11-16 00:21:55,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:55,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:21:55,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719628635] [2019-11-16 00:21:55,257 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:55,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:21:55,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:21:55,258 INFO L87 Difference]: Start difference. First operand 1989 states and 2244 transitions. cyclomatic complexity: 257 Second operand 4 states. [2019-11-16 00:21:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:56,100 INFO L93 Difference]: Finished difference Result 2552 states and 2753 transitions. [2019-11-16 00:21:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:21:56,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2552 states and 2753 transitions. [2019-11-16 00:21:56,112 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2546 [2019-11-16 00:21:56,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2552 states to 2552 states and 2753 transitions. [2019-11-16 00:21:56,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2552 [2019-11-16 00:21:56,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2552 [2019-11-16 00:21:56,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2552 states and 2753 transitions. [2019-11-16 00:21:56,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:56,136 INFO L688 BuchiCegarLoop]: Abstraction has 2552 states and 2753 transitions. [2019-11-16 00:21:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states and 2753 transitions. [2019-11-16 00:21:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2130. [2019-11-16 00:21:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-11-16 00:21:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2325 transitions. [2019-11-16 00:21:56,173 INFO L711 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-11-16 00:21:56,173 INFO L591 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-11-16 00:21:56,173 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:21:56,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2130 states and 2325 transitions. [2019-11-16 00:21:56,180 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2124 [2019-11-16 00:21:56,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:56,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:56,182 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:56,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 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, 1] [2019-11-16 00:21:56,182 INFO L791 eck$LassoCheckResult]: Stem: 21661#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 21532#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 21533#L606-2 [2019-11-16 00:21:56,183 INFO L793 eck$LassoCheckResult]: Loop: 21533#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 23339#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 23336#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 23333#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 23330#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 23327#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 23324#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 22297#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22298#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 23465#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 23463#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 23461#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 23459#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 23457#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 23455#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 23453#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 23451#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 23449#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 23447#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 23445#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 23443#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 23441#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 23438#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 23435#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 23432#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 23429#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 23427#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 23425#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 23423#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 21546#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21839#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 21837#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 21834#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 21835#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 22351#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 22349#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 22347#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 22345#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 22343#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 22341#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22339#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 22337#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22335#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 22333#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 22331#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 22329#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 22327#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 22325#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 22323#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 22321#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 22319#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 22317#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 22315#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 22313#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 22311#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 22309#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 22307#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 22134#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 22135#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 22949#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 22944#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 22361#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 22362#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 22922#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 22916#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 22910#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 22904#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 22898#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22892#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 22886#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 22576#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 22577#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 22583#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 22566#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 22561#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 22359#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 22360#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 22663#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 22661#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 22659#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 22657#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 22655#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 22653#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 22024#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21533#L606-2 [2019-11-16 00:21:56,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-11-16 00:21:56,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:56,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839743109] [2019-11-16 00:21:56,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:56,188 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:56,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:56,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1701192337, now seen corresponding path program 1 times [2019-11-16 00:21:56,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:56,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500036337] [2019-11-16 00:21:56,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:21:56,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500036337] [2019-11-16 00:21:56,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:56,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:56,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616675610] [2019-11-16 00:21:56,249 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:56,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:56,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:56,250 INFO L87 Difference]: Start difference. First operand 2130 states and 2325 transitions. cyclomatic complexity: 198 Second operand 3 states. [2019-11-16 00:21:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:56,511 INFO L93 Difference]: Finished difference Result 1838 states and 1967 transitions. [2019-11-16 00:21:56,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:56,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 1967 transitions. [2019-11-16 00:21:56,517 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1833 [2019-11-16 00:21:56,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 1838 states and 1967 transitions. [2019-11-16 00:21:56,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1838 [2019-11-16 00:21:56,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1838 [2019-11-16 00:21:56,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1838 states and 1967 transitions. [2019-11-16 00:21:56,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:56,532 INFO L688 BuchiCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2019-11-16 00:21:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states and 1967 transitions. [2019-11-16 00:21:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1278. [2019-11-16 00:21:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-11-16 00:21:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1407 transitions. [2019-11-16 00:21:56,556 INFO L711 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-11-16 00:21:56,556 INFO L591 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-11-16 00:21:56,556 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:21:56,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1278 states and 1407 transitions. [2019-11-16 00:21:56,559 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1273 [2019-11-16 00:21:56,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:56,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:56,561 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:56,561 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:21:56,562 INFO L791 eck$LassoCheckResult]: Stem: 25622#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 25503#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 25504#L606-2 [2019-11-16 00:21:56,562 INFO L793 eck$LassoCheckResult]: Loop: 25504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26311#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 26309#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 26307#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26305#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 26303#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26301#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 26299#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26297#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26295#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 26293#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 26289#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 26290#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26284#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 26280#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26281#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26272#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26273#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 26264#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 26265#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26256#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 26257#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26248#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26249#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 26236#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26237#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 26224#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 26225#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25818#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 25635#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25813#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 25810#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 25807#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 25803#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 25799#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 25795#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25791#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 25785#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 25780#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 25774#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 25768#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 25763#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 25758#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 25753#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 25748#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 25743#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 25738#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 25732#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 25727#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 25722#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 25717#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 25712#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 25707#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 25702#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 25697#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 25693#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 25688#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 25684#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25680#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 25676#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 25671#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 25672#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 25821#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 25822#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25914#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 25909#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 25904#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 25899#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 25894#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 25890#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 25886#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 25882#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 25878#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 25874#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 25870#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 25866#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 25862#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 25858#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 25854#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 25850#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 25846#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 25842#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 25838#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 25834#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 25830#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 25825#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 25826#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 26132#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 26129#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 26126#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 26123#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 26120#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 26117#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26114#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 26111#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 26108#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 26105#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 26102#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 26099#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 26096#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 26093#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 26090#L394 assume ((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a19~0 := 0;~a28~0 := 7;calculate_output_#res := 25; 25566#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 26313#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26312#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 26310#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 26308#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26306#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 26304#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26302#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 26300#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26298#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26296#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 26294#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 26292#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 26287#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26288#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 26291#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26276#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26277#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26268#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 26269#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 26260#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26261#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 26252#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26253#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26242#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 26243#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26230#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 26231#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 25772#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25504#L606-2 [2019-11-16 00:21:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:56,563 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-11-16 00:21:56,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:56,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516902302] [2019-11-16 00:21:56,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:56,568 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash -645173945, now seen corresponding path program 1 times [2019-11-16 00:21:56,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:56,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709755842] [2019-11-16 00:21:56,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:56,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:21:56,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709755842] [2019-11-16 00:21:56,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:56,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:56,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959981318] [2019-11-16 00:21:56,639 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:21:56,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:56,639 INFO L87 Difference]: Start difference. First operand 1278 states and 1407 transitions. cyclomatic complexity: 133 Second operand 3 states. [2019-11-16 00:21:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:57,139 INFO L93 Difference]: Finished difference Result 1841 states and 1970 transitions. [2019-11-16 00:21:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:57,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1841 states and 1970 transitions. [2019-11-16 00:21:57,144 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1835 [2019-11-16 00:21:57,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1841 states to 1841 states and 1970 transitions. [2019-11-16 00:21:57,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1841 [2019-11-16 00:21:57,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1841 [2019-11-16 00:21:57,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 1970 transitions. [2019-11-16 00:21:57,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:21:57,169 INFO L688 BuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2019-11-16 00:21:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 1970 transitions. [2019-11-16 00:21:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1418. [2019-11-16 00:21:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-11-16 00:21:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1541 transitions. [2019-11-16 00:21:57,192 INFO L711 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-11-16 00:21:57,192 INFO L591 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-11-16 00:21:57,192 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:21:57,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1418 states and 1541 transitions. [2019-11-16 00:21:57,196 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1412 [2019-11-16 00:21:57,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:21:57,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:21:57,197 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:21:57,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:57,198 INFO L791 eck$LassoCheckResult]: Stem: 28746#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 28628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 28629#L606-2 [2019-11-16 00:21:57,199 INFO L793 eck$LassoCheckResult]: Loop: 28629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 29450#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 29447#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 29444#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 29441#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 29438#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29435#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 29432#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 29429#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29426#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 29423#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 29415#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 29416#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 29407#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 29408#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 29399#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 29400#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 29391#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 29392#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 29383#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 29384#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 29375#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 29376#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 29367#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 29368#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29355#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 29356#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 29343#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 29344#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 29413#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 29414#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 29405#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 29406#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 29397#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29398#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 29389#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 29390#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 29381#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 29382#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 29373#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 29374#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 29363#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 29364#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 29351#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 29352#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 29245#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 29246#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 29359#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 29360#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 29347#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 29348#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 28916#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 28917#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 29711#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 29708#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 29705#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 29702#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 29699#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 29696#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 29693#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 29690#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 29687#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 29684#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29681#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 29678#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 29675#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 29672#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 29669#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 29666#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 29663#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 29660#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 29657#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29654#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 29651#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 29648#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 29645#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 29642#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 29639#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29636#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29633#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29630#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29627#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29624#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29621#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29618#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29615#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29612#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29609#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29606#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29603#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29600#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29597#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29594#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29591#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29588#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29585#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29582#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29579#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29576#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29573#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29570#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29567#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29564#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29561#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29558#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29555#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29552#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29549#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29546#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29543#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29540#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29537#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29534#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29531#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29528#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29525#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29522#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29519#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29516#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29513#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29510#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29507#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29504#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29501#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29498#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29495#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29492#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29489#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29486#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29483#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29480#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29477#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29474#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29471#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29468#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29465#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29462#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29459#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29456#L594-1 calculate_output_#res := -2; 29454#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 28629#L606-2 [2019-11-16 00:21:57,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:57,200 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-11-16 00:21:57,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:57,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579773900] [2019-11-16 00:21:57,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:57,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:57,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:57,206 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-11-16 00:21:57,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:57,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121988389] [2019-11-16 00:21:57,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:57,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:57,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:57,293 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-11-16 00:21:57,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:57,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961847919] [2019-11-16 00:21:57,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:57,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:57,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:21:57,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961847919] [2019-11-16 00:21:57,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:57,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:21:57,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791964315] [2019-11-16 00:21:59,188 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-11-16 00:21:59,311 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-16 00:21:59,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:59,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:21:59,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:21:59,314 INFO L87 Difference]: Start difference. First operand 1418 states and 1541 transitions. cyclomatic complexity: 128 Second operand 9 states. [2019-11-16 00:22:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:00,102 INFO L93 Difference]: Finished difference Result 1330 states and 1452 transitions. [2019-11-16 00:22:00,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:22:00,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1452 transitions. [2019-11-16 00:22:00,107 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-11-16 00:22:00,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-11-16 00:22:00,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2019-11-16 00:22:00,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2019-11-16 00:22:00,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1452 transitions. [2019-11-16 00:22:00,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:00,119 INFO L688 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-11-16 00:22:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1452 transitions. [2019-11-16 00:22:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2019-11-16 00:22:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-11-16 00:22:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-11-16 00:22:00,137 INFO L711 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-11-16 00:22:00,137 INFO L591 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-11-16 00:22:00,137 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:22:00,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1452 transitions. [2019-11-16 00:22:00,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-11-16 00:22:00,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:00,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:00,142 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:22:00,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:00,142 INFO L791 eck$LassoCheckResult]: Stem: 31519#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 31398#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 31399#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32229#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 32226#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 32223#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 31441#L597 [2019-11-16 00:22:00,142 INFO L793 eck$LassoCheckResult]: Loop: 31441#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 32483#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32480#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 32476#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 32472#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 32468#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 32464#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 32457#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 31441#L597 [2019-11-16 00:22:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-11-16 00:22:00,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:00,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277087268] [2019-11-16 00:22:00,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:00,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:00,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:00,151 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-11-16 00:22:00,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:00,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126779664] [2019-11-16 00:22:00,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:00,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:00,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:00,166 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-11-16 00:22:00,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:00,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063111477] [2019-11-16 00:22:00,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:00,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:00,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:00,184 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:00,451 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-11-16 00:22:00,518 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:00,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:00,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:00,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:00,518 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:00,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:00,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:00,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:00,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label22.c_Iteration12_Lasso [2019-11-16 00:22:00,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:00,519 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:00,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:00,901 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:00,901 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,907 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,907 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,915 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,925 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,925 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,933 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,933 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,949 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,949 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,958 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,958 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,969 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,969 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,978 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,978 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,988 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,988 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:00,994 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:00,994 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:00,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:00,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,002 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,002 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,016 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,023 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,033 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:01,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,038 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:01,041 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,041 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,046 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:01,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,286 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,286 INFO L440 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=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 15, 13] Nus: [0, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,294 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,294 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,301 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,301 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:01,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,306 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:01,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,439 INFO L440 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=18}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=28}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,446 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,446 INFO L440 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/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/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 [2019-11-16 00:22:01,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:01,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:01,453 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:01,454 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-11-16 00:22:01,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:22:01 BoogieIcfgContainer [2019-11-16 00:22:01,483 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:22:01,483 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:22:01,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:22:01,483 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:22:01,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:44" (3/4) ... [2019-11-16 00:22:01,487 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:22:01,530 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e30fc788-4e9a-449b-9279-ca4b8e7e4019/bin/uautomizer/witness.graphml [2019-11-16 00:22:01,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:22:01,532 INFO L168 Benchmark]: Toolchain (without parser) took 19884.36 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 478.7 MB). Free memory was 934.3 MB in the beginning and 1.0 GB in the end (delta: -67.3 MB). Peak memory consumption was 411.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:01,532 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:01,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:01,533 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:01,533 INFO L168 Benchmark]: Boogie Preprocessor took 93.21 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:01,533 INFO L168 Benchmark]: RCFGBuilder took 1705.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.3 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:01,534 INFO L168 Benchmark]: BuchiAutomizer took 17279.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 348.1 MB). Free memory was 982.3 MB in the beginning and 1.0 GB in the end (delta: -35.7 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:01,534 INFO L168 Benchmark]: Witness Printer took 47.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:01,536 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 652.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 934.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.21 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1705.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.3 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17279.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 348.1 MB). Free memory was 982.3 MB in the beginning and 1.0 GB in the end (delta: -35.7 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. * Witness Printer took 47.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 1330 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 8.7s. Construction of modules took 5.5s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1975 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 2130 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1503 SDtfs, 1791 SDslu, 175 SDs, 0 SdLazy, 4260 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 139ms 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@1ad1a4e=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c2c8edc=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@1ad1a4e=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c2c8edc=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@1ad1a4e=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@c2c8edc=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 -5*0^k, output=-1 + sum_{k=0}^i 18*0^k + -23*0^k + -23*k*0^(k-1) + 28*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*0^k, input=6 + sum_{k=0}^i -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 4GEVs Lambdas: [0, 15, 13, 0, 0, 0] Mus: [0, 1, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...