./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label01_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label01_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4facd755ec6bf0af5c404932d2a8a73ce9edcfbd .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:04:33,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:04:33,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:04:33,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:04:33,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:04:33,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:04:33,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:04:33,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:04:33,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:04:33,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:04:33,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:04:33,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:04:33,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:04:33,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:04:33,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:04:33,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:04:33,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:04:33,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:04:33,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:04:33,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:04:33,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:04:33,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:04:33,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:04:33,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:04:33,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:04:33,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:04:33,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:04:33,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:04:33,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:04:33,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:04:33,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:04:33,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:04:33,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:04:33,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:04:33,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:04:33,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:04:33,487 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 01:04:33,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:04:33,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:04:33,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:04:33,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:04:33,496 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:04:33,496 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 01:04:33,496 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 01:04:33,496 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 01:04:33,496 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 01:04:33,496 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 01:04:33,496 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 01:04:33,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 01:04:33,497 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:04:33,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 01:04:33,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:04:33,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:04:33,498 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 01:04:33,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:04:33,498 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:04:33,498 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 01:04:33,499 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 01:04:33,499 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4facd755ec6bf0af5c404932d2a8a73ce9edcfbd [2018-12-09 01:04:33,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:04:33,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:04:33,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:04:33,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:04:33,525 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:04:33,525 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label01_true-unreach-call_false-termination.c [2018-12-09 01:04:33,559 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/data/1bf0f40a8/dd0e775912a84efc8d7fa00f9ac95c4c/FLAG82b79c598 [2018-12-09 01:04:34,043 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:04:34,043 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/sv-benchmarks/c/eca-rers2012/Problem02_label01_true-unreach-call_false-termination.c [2018-12-09 01:04:34,050 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/data/1bf0f40a8/dd0e775912a84efc8d7fa00f9ac95c4c/FLAG82b79c598 [2018-12-09 01:04:34,058 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/data/1bf0f40a8/dd0e775912a84efc8d7fa00f9ac95c4c [2018-12-09 01:04:34,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:04:34,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:04:34,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:04:34,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:04:34,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:04:34,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34, skipping insertion in model container [2018-12-09 01:04:34,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:04:34,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:04:34,261 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:04:34,264 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:04:34,310 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:04:34,360 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:04:34,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34 WrapperNode [2018-12-09 01:04:34,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:04:34,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:04:34,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:04:34,361 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:04:34,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:04:34,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:04:34,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:04:34,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:04:34,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... [2018-12-09 01:04:34,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:04:34,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:04:34,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:04:34,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:04:34,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:04:34,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:04:35,053 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:04:35,053 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 01:04:35,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:04:35 BoogieIcfgContainer [2018-12-09 01:04:35,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:04:35,054 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 01:04:35,054 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 01:04:35,056 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 01:04:35,056 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:04:35,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:04:34" (1/3) ... [2018-12-09 01:04:35,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@183621f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:04:35, skipping insertion in model container [2018-12-09 01:04:35,057 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:04:35,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:34" (2/3) ... [2018-12-09 01:04:35,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@183621f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:04:35, skipping insertion in model container [2018-12-09 01:04:35,058 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:04:35,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:04:35" (3/3) ... [2018-12-09 01:04:35,059 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label01_true-unreach-call_false-termination.c [2018-12-09 01:04:35,089 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:04:35,090 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 01:04:35,090 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 01:04:35,090 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 01:04:35,090 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:04:35,090 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:04:35,090 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 01:04:35,090 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:04:35,090 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 01:04:35,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-09 01:04:35,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-09 01:04:35,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:35,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:35,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:35,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:04:35,125 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 01:04:35,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-09 01:04:35,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-09 01:04:35,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:35,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:35,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:35,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:04:35,134 INFO L794 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 [2018-12-09 01:04:35,134 INFO L796 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 [2018-12-09 01:04:35,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 01:04:35,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:35,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:35,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:35,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:35,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-09 01:04:35,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:35,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:35,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:35,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:35,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:35,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-09 01:04:35,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:35,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:35,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:04:35,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:04:35,378 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:04:35,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:04:35,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:04:35,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:04:35,379 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 01:04:35,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:04:35,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:04:35,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label01_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-09 01:04:35,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:04:35,380 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:04:35,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,615 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:04:35,615 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,623 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:35,623 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,642 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:35,642 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,658 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,666 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:35,666 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,690 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:35,692 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:35,711 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,735 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:35,737 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:35,756 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:35,770 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 01:04:35,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:35,811 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 01:04:35,812 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:04:35,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:04:35,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:04:35,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:04:35,813 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:04:35,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:35,813 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:04:35,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:04:35,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label01_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-09 01:04:35,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:04:35,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:04:35,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:35,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:36,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:04:36,007 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:04:36,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:36,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:36,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,024 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:36,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:36,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:36,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:36,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:36,058 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,062 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-09 01:04:36,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,064 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,065 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,075 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,075 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,079 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,079 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,081 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-09 01:04:36,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,099 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,099 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,104 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,105 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,108 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,109 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,112 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,113 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,115 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,115 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,121 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-09 01:04:36,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,122 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,136 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,136 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,138 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 01:04:36,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,150 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,151 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,156 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,159 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,162 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,163 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,165 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,165 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,166 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:36,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,170 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-09 01:04:36,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,171 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,172 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,196 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,196 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,199 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,200 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,201 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-09 01:04:36,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,213 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,214 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,218 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,219 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,222 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,222 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,225 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,225 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:36,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,227 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,227 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,227 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:36,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,231 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-09 01:04:36,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,232 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,233 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,234 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,244 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,244 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,245 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,245 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,249 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,249 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,251 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-09 01:04:36,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,273 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,273 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,274 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,278 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,278 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,279 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,279 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,283 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,283 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,286 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,286 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,287 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:36,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,288 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,289 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,289 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:36,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,293 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-09 01:04:36,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,294 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,295 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,296 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,305 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,305 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,306 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,310 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,310 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,310 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,312 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 01:04:36,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,331 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,332 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,332 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,336 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,337 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,337 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,340 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,341 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,341 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,345 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,345 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,346 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,348 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:36,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,348 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,349 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:36,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,354 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-09 01:04:36,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,355 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,355 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,357 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,365 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,366 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,367 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,371 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,371 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,371 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,375 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-09 01:04:36,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,399 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,400 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,401 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,406 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,407 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,408 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,412 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,413 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,417 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,418 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:36,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,419 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,420 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,420 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:36,421 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:36,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,428 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-09 01:04:36,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,429 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,430 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,437 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,437 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,438 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,438 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,441 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,441 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,441 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,442 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 01:04:36,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,453 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,454 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,458 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,458 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,458 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,459 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,461 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,461 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,462 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,462 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,464 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,465 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,465 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:36,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,467 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:36,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,468 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:36,468 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:36,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,473 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-09 01:04:36,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,474 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,474 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,493 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,494 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,494 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,498 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,498 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-09 01:04:36,498 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,500 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-09 01:04:36,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,543 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,543 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,549 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,550 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,550 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,553 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,554 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,557 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,557 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:36,558 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:36,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:36,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:36,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:36,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:36,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:36,562 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:36,562 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:36,563 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 01:04:36,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:36,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:04:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:04:36,579 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-09 01:04:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:04:37,002 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-09 01:04:37,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:04:37,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-09 01:04:37,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-09 01:04:37,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-09 01:04:37,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-09 01:04:37,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-09 01:04:37,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-09 01:04:37,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:04:37,018 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-09 01:04:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-09 01:04:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-09 01:04:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-09 01:04:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-09 01:04:37,045 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-09 01:04:37,045 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-09 01:04:37,045 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 01:04:37,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-09 01:04:37,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-09 01:04:37,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:37,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:37,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:37,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:04:37,047 INFO L794 eck$LassoCheckResult]: Stem: 764#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; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-12-09 01:04:37,047 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#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; 752#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); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#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); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#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); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#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; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-12-09 01:04:37,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-09 01:04:37,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:37,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:37,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:37,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:37,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-09 01:04:37,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:37,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:37,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:37,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:04:37,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:37,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:37,065 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-09 01:04:37,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:37,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:37,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:37,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:37,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:37,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:04:37,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:04:37,164 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:04:37,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:04:37,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:04:37,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:04:37,164 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 01:04:37,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:04:37,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:04:37,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label01_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-09 01:04:37,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:04:37,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:04:37,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,261 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:04:37,262 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:37,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:37,266 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:37,266 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:37,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:37,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:37,285 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:37,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:37,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:37,302 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:37,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:37,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:37,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:37,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:37,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:37,336 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:37,352 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 01:04:37,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:37,393 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 01:04:37,395 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:04:37,395 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:04:37,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:04:37,395 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:04:37,396 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:04:37,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:37,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:04:37,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:04:37,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label01_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-09 01:04:37,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:04:37,396 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:04:37,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:37,523 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:04:37,523 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:04:37,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:37,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,527 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,527 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:37,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:37,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,531 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,531 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,533 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,533 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:37,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:04:37,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:04:37,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,540 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-09 01:04:37,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,541 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,542 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,542 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,544 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,544 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,545 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,545 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,546 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,547 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,549 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,549 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,598 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,598 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,600 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,601 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-09 01:04:37,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,602 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,602 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,603 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,604 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,605 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,605 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,606 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,607 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,607 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,608 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,610 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,610 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,610 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,614 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,614 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,617 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,618 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-09 01:04:37,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,618 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,619 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,620 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,620 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,620 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:37,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,621 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,621 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,622 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,622 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,624 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,624 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:37,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,627 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:37,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,630 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:04:37,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,633 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,633 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,634 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-09 01:04:37,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,635 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,635 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,635 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,637 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,638 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,639 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,639 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,640 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,640 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,642 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,642 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,645 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,645 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,649 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,649 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,649 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,650 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,654 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,654 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 01:04:37,654 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 01:04:37,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,655 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-09 01:04:37,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,656 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,656 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,658 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,659 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,659 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,659 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,661 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,662 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,664 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,664 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,665 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,669 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,669 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,669 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,670 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,676 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,676 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,677 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,680 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-09 01:04:37,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,681 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,683 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-09 01:04:37,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,684 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,684 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,684 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,687 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,687 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,687 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,688 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:37,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,689 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,689 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,690 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,691 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,691 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,691 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,694 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,694 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,694 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,695 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:37,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,700 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,700 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,702 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-09 01:04:37,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,712 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,712 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,713 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,718 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,718 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-09 01:04:37,719 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-09 01:04:37,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,722 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-09 01:04:37,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,723 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,725 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,725 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,725 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,727 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,727 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,730 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,730 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,730 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,731 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,734 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,734 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,734 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:04:37,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,739 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,739 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,743 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-09 01:04:37,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-09 01:04:37,744 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:04:37,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,746 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-09 01:04:37,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,746 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,746 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,749 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,749 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,749 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,749 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 01:04:37,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,751 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,753 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,753 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,755 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,755 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,755 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,756 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 01:04:37,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,763 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:04:37,763 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,764 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 01:04:37,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,774 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,774 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:04:37,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-09 01:04:37,784 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-09 01:04:37,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:04:37,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:04:37,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:04:37,784 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-09 01:04:37,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:04:37,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:04:37,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:04:37,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:04:37,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:04:37,789 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-09 01:04:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:04:38,065 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-09 01:04:38,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:04:38,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-09 01:04:38,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-09 01:04:38,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-09 01:04:38,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-09 01:04:38,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-09 01:04:38,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-09 01:04:38,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:04:38,071 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-09 01:04:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-09 01:04:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-09 01:04:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-09 01:04:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-09 01:04:38,081 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-09 01:04:38,081 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-09 01:04:38,081 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 01:04:38,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-09 01:04:38,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-09 01:04:38,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:38,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:38,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:38,084 INFO L867 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] [2018-12-09 01:04:38,084 INFO L794 eck$LassoCheckResult]: Stem: 1666#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; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-12-09 01:04:38,084 INFO L796 eck$LassoCheckResult]: Loop: 1540#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; 1657#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); 1663#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; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#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; 1890#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); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#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); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#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); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#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)); 1836#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); 1832#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); 1828#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); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#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); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#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); 1806#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); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#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); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#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); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#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); 1788#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); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#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); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#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); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#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); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#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); 1868#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); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#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); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#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)); 1855#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); 1853#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; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-12-09 01:04:38,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-09 01:04:38,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:38,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-09 01:04:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:04:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:38,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:04:38,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:04:38,119 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:04:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:04:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:04:38,119 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-09 01:04:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:04:38,567 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-09 01:04:38,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:04:38,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-09 01:04:38,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-09 01:04:38,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-09 01:04:38,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-09 01:04:38,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-09 01:04:38,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-09 01:04:38,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:04:38,578 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-09 01:04:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-09 01:04:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-09 01:04:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-09 01:04:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-09 01:04:38,592 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-09 01:04:38,592 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-09 01:04:38,592 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 01:04:38,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-09 01:04:38,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-09 01:04:38,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:38,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:38,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:38,597 INFO L867 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] [2018-12-09 01:04:38,597 INFO L794 eck$LassoCheckResult]: Stem: 3434#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; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-12-09 01:04:38,598 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#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; 3682#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); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#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); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#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); 3677#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; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#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; 3892#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; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#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; 3869#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); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#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); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#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); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#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)); 3850#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); 3849#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); 3848#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); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#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); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#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); 3835#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); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#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); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#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); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#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); 3819#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); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#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); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#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); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#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); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#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); 3789#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); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#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); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#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)); 3772#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); 3685#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; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-12-09 01:04:38,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-09 01:04:38,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:38,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:38,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-09 01:04:38,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:38,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:04:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:04:38,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:04:38,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:04:38,621 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:04:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:04:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:04:38,621 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-09 01:04:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:04:38,887 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-09 01:04:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:04:38,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-09 01:04:38,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 01:04:38,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-09 01:04:38,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-09 01:04:38,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-09 01:04:38,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-09 01:04:38,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:04:38,934 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-09 01:04:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-09 01:04:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-09 01:04:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-09 01:04:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-09 01:04:38,944 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-09 01:04:38,944 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-09 01:04:38,944 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 01:04:38,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-09 01:04:38,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 01:04:38,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:38,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:38,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:38,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:04:38,948 INFO L794 eck$LassoCheckResult]: Stem: 5882#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; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-12-09 01:04:38,949 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#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; 6147#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); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#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); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#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); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#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)); 6140#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); 6139#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); 6138#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); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#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); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#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; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#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; 6329#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; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#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; 6327#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); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#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); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#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); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#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)); 6313#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); 6312#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); 6311#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); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#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); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#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); 6299#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); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#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); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#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); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#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); 6283#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); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#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); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#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); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#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); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#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); 6253#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); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#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); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#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)); 6236#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); 6150#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; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-12-09 01:04:38,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-09 01:04:38,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:38,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:38,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:38,952 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-09 01:04:38,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:38,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:04:38,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:04:38,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:04:38,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:04:38,970 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:04:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:04:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:04:38,970 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-09 01:04:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:04:39,252 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-09 01:04:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:04:39,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-09 01:04:39,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 01:04:39,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-09 01:04:39,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-09 01:04:39,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-09 01:04:39,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-09 01:04:39,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:04:39,264 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-09 01:04:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-09 01:04:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-09 01:04:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-09 01:04:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-09 01:04:39,279 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-09 01:04:39,279 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-09 01:04:39,279 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 01:04:39,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-09 01:04:39,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-09 01:04:39,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:39,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:39,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:39,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:04:39,285 INFO L794 eck$LassoCheckResult]: Stem: 8462#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; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-12-09 01:04:39,285 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#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; 8710#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); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#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); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#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); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#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)); 8680#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); 8677#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); 8674#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); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#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); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#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); 8652#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); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#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); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#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); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#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); 8628#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); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#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; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#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; 8676#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); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#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); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#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); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#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)); 8654#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); 8651#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); 8648#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); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#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); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#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); 8627#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); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#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); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#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); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#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); 8603#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); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#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); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#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); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#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); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#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); 8555#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); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#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); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#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)); 8536#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); 8532#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; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-12-09 01:04:39,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-09 01:04:39,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:39,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:39,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-09 01:04:39,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:39,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:04:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:39,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:04:39,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:04:39,327 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 01:04:39,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:04:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:04:39,327 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-09 01:04:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:04:39,479 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-09 01:04:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:04:39,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-09 01:04:39,482 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-09 01:04:39,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-09 01:04:39,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-09 01:04:39,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-09 01:04:39,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-09 01:04:39,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:04:39,486 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-09 01:04:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-09 01:04:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-09 01:04:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-09 01:04:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-09 01:04:39,494 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-09 01:04:39,494 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-09 01:04:39,495 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 01:04:39,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-09 01:04:39,497 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-09 01:04:39,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:39,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:39,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 01:04:39,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:04:39,498 INFO L794 eck$LassoCheckResult]: Stem: 11021#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; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-12-09 01:04:39,498 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#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; 11768#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); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#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); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#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); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#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)); 11802#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); 11800#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); 11798#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); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#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); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#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); 11784#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); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#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); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#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); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#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); 11769#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); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#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); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#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); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#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); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#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); 12078#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); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#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); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#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)); 11746#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); 11744#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); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#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); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#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); 11015#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); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#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); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#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); 10975#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); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#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)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#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); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#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)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#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)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#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)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#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); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-12-09 01:04:39,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-09 01:04:39,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:39,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:39,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-09 01:04:39,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:39,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:39,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-09 01:04:39,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:39,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:39,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:04:39,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:04:40,428 WARN L180 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-09 01:04:40,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:04:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:04:40,491 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-09 01:04:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:04:40,941 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-09 01:04:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:04:40,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-09 01:04:40,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-09 01:04:40,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-09 01:04:40,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-09 01:04:40,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-09 01:04:40,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-09 01:04:40,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:04:40,948 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-09 01:04:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-09 01:04:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-09 01:04:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-09 01:04:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-09 01:04:40,957 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-09 01:04:40,957 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-09 01:04:40,957 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 01:04:40,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-09 01:04:40,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-09 01:04:40,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:04:40,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:04:40,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 01:04:40,959 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:04:40,960 INFO L794 eck$LassoCheckResult]: Stem: 13549#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; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#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; 14303#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); 14301#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; 13503#L597 [2018-12-09 01:04:40,960 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#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; 13539#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); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#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); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#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; 13503#L597 [2018-12-09 01:04:40,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-09 01:04:40,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:40,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-09 01:04:40,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:40,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:40,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:40,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-09 01:04:40,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:04:40,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:04:40,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:40,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:04:40,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:04:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:04:41,107 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:04:41,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:04:41,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:04:41,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:04:41,107 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 01:04:41,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:04:41,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:04:41,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label01_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-09 01:04:41,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:04:41,108 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:04:41,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:04:41,293 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:04:41,293 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,298 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,299 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,315 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,317 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,317 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,335 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,351 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,353 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,353 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,370 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,370 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,386 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,388 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,388 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,406 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,406 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,423 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,440 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,473 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,475 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,475 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,490 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,492 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,492 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,507 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,509 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,527 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,527 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,543 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,544 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,565 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 01:04:41,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,731 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,731 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,748 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,748 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,765 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,780 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 01:04:41,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,930 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,930 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,947 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:04:41,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 01:04:41,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 01:04:41,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 01:04:41,963 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-09 01:04:41,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 01:04:41 BoogieIcfgContainer [2018-12-09 01:04:41,997 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 01:04:41,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:04:41,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:04:41,998 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:04:41,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:04:35" (3/4) ... [2018-12-09 01:04:42,001 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 01:04:42,037 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d00a2505-b170-4bb5-a7b5-8e136564a6c5/bin-2019/uautomizer/witness.graphml [2018-12-09 01:04:42,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:04:42,038 INFO L168 Benchmark]: Toolchain (without parser) took 7977.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.4 MB). Free memory was 945.2 MB in the beginning and 1.4 GB in the end (delta: -414.1 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:04:42,038 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:04:42,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:04:42,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:04:42,039 INFO L168 Benchmark]: Boogie Preprocessor took 28.59 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:04:42,039 INFO L168 Benchmark]: RCFGBuilder took 621.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:04:42,040 INFO L168 Benchmark]: BuchiAutomizer took 6943.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -345.6 MB). Peak memory consumption was 538.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:04:42,040 INFO L168 Benchmark]: Witness Printer took 39.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 772.7 kB). Peak memory consumption was 772.7 kB. Max. memory is 11.5 GB. [2018-12-09 01:04:42,042 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.59 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 621.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6943.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -345.6 MB). Peak memory consumption was 538.4 MB. Max. memory is 11.5 GB. * Witness Printer took 39.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 772.7 kB). Peak memory consumption was 772.7 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. Construction of modules took 1.6s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 44ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - 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@77a07f25=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fc235b9=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@77a07f25=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fc235b9=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@77a07f25=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@7fc235b9=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [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...