./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e94bad701dc31ef8837df5dc0d8bbaaa41b948fd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:32:10,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:32:10,994 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:32:11,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:32:11,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:32:11,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:32:11,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:32:11,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:32:11,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:32:11,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:32:11,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:32:11,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:32:11,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:32:11,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:32:11,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:32:11,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:32:11,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:32:11,023 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:32:11,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:32:11,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:32:11,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:32:11,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:32:11,033 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:32:11,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:32:11,033 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:32:11,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:32:11,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:32:11,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:32:11,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:32:11,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:32:11,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:32:11,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:32:11,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:32:11,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:32:11,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:32:11,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:32:11,043 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:32:11,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:32:11,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:32:11,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:32:11,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:32:11,062 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:32:11,063 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:32:11,063 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:32:11,063 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:32:11,063 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:32:11,063 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:32:11,063 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:32:11,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:32:11,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:32:11,064 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:32:11,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:32:11,064 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:32:11,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:32:11,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:32:11,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:32:11,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:32:11,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:32:11,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:32:11,067 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:32:11,067 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:32:11,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:32:11,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:32:11,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:32:11,068 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:32:11,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:32:11,069 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:32:11,069 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:32:11,071 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:32:11,071 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e94bad701dc31ef8837df5dc0d8bbaaa41b948fd [2018-11-28 23:32:11,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:32:11,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:32:11,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:32:11,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:32:11,151 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:32:11,152 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2018-11-28 23:32:11,216 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08369a3d5/8bd388d3970947df8ce62b9057b1bd7f/FLAGe2d8c6da5 [2018-11-28 23:32:11,756 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:32:11,757 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label19_true-unreach-call_false-termination.c [2018-11-28 23:32:11,778 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08369a3d5/8bd388d3970947df8ce62b9057b1bd7f/FLAGe2d8c6da5 [2018-11-28 23:32:12,004 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08369a3d5/8bd388d3970947df8ce62b9057b1bd7f [2018-11-28 23:32:12,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:32:12,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:32:12,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:32:12,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:32:12,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:32:12,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:12,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b94ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12, skipping insertion in model container [2018-11-28 23:32:12,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:12,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:32:12,100 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:32:12,645 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:32:12,653 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:32:12,794 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:32:12,814 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:32:12,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12 WrapperNode [2018-11-28 23:32:12,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:32:12,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:32:12,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:32:12,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:32:12,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:12,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:32:13,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:32:13,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:32:13,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:32:13,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... [2018-11-28 23:32:13,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:32:13,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:32:13,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:32:13,090 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:32:13,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:32:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:32:16,661 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:32:16,662 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:32:16,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:16 BoogieIcfgContainer [2018-11-28 23:32:16,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:32:16,665 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:32:16,665 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:32:16,669 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:32:16,670 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:32:16,670 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:32:12" (1/3) ... [2018-11-28 23:32:16,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d1efcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:32:16, skipping insertion in model container [2018-11-28 23:32:16,677 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:32:16,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:32:12" (2/3) ... [2018-11-28 23:32:16,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d1efcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:32:16, skipping insertion in model container [2018-11-28 23:32:16,678 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:32:16,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:16" (3/3) ... [2018-11-28 23:32:16,681 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label19_true-unreach-call_false-termination.c [2018-11-28 23:32:16,754 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:32:16,754 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:32:16,755 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:32:16,755 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:32:16,755 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:32:16,755 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:32:16,755 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:32:16,755 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:32:16,756 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:32:16,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 23:32:16,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 23:32:16,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:16,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:16,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:16,835 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:32:16,835 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:32:16,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 23:32:16,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 23:32:16,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:16,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:16,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:16,852 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:32:16,862 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-11-28 23:32:16,863 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-11-28 23:32:16,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:32:16,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:16,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:16,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:16,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:16,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-28 23:32:16,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:16,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:16,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:16,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:16,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:17,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:17,022 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-28 23:32:17,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:17,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:17,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:17,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:17,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:32:17,557 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-28 23:32:17,669 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 23:32:17,682 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:17,683 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:17,683 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:17,683 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:17,683 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:32:17,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:17,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:17,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:17,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 23:32:17,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:17,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:17,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:17,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:17,892 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-28 23:32:17,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:17,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:17,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:17,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:17,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:17,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,229 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-28 23:32:18,318 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:18,319 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:18,333 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:18,333 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:18,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:18,372 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:18,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:18,401 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:18,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,439 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:18,468 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:18,576 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:18,576 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:18,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:18,614 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,637 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:18,643 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:18,643 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:18,664 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:18,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:18,720 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:32:18,722 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:18,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:18,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:18,722 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:18,722 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:32:18,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:18,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:18,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:18,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 23:32:18,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:18,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:18,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:18,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:19,151 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 23:32:19,415 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-28 23:32:19,791 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 23:32:19,793 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:19,800 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:32:19,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:19,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:19,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:19,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:19,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,843 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:19,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:19,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:19,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:19,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:19,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:19,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:19,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:19,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:19,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:19,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,965 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:19,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:19,966 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:19,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:19,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:19,983 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 23:32:19,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:19,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:19,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:19,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:19,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:19,988 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:19,990 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:19,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,015 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,015 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,025 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,025 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,033 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 23:32:20,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,078 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,094 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,095 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,105 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,111 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,115 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,116 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,124 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:20,124 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:20,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,139 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 23:32:20,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,144 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,145 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,164 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,164 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,178 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,178 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,181 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:20,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,218 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,219 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,232 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,233 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,237 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,238 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,248 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,249 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,258 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:20,258 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,259 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:20,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,270 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 23:32:20,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,272 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,277 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,299 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,300 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,312 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,312 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,317 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 23:32:20,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,341 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,342 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,351 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,352 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,358 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,359 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,372 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,372 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:20,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,379 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:20,379 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,380 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:20,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,391 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 23:32:20,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,392 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,393 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,397 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,423 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,424 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,424 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,434 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,434 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,435 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,438 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,440 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 23:32:20,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,503 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,505 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,505 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,510 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,521 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,521 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,522 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,534 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,535 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,535 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,539 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,540 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:20,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,542 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,542 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:20,543 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:20,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:20,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,550 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 23:32:20,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,551 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,552 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,553 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,568 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,570 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,575 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,575 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,575 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,578 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:20,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,615 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,617 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,623 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,624 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,625 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,629 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,630 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,631 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,636 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,636 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,637 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,639 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:20,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,640 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:20,640 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,641 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:20,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,651 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 23:32:20,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,652 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,653 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,655 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,669 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,670 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,671 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,678 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,678 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,679 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,684 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 23:32:20,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,732 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,733 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,734 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,744 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,744 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,745 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,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-11-28 23:32:20,752 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,752 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,753 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,754 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,760 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,761 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,761 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,762 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:20,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,764 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:20,765 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:20,767 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:20,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,781 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 23:32:20,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,783 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,798 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,803 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,804 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,807 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:20,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,838 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,840 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,847 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,852 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,852 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,857 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:20,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,863 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:20,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,863 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:20,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:20,867 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:20,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,875 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 23:32:20,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,876 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,876 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:20,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:20,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:20,926 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:20,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:20,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:20,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:20,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:20,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:20,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:20,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:20,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:20,938 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 23:32:20,938 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:20,943 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 23:32:20,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:21,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:21,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:21,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:21,051 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:21,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:21,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:21,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:21,052 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:21,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:21,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:21,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:21,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:21,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:21,070 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:21,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:21,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:21,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:21,070 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:21,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:21,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:21,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:21,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:21,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:21,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:21,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:21,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:21,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:21,082 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:21,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:21,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:21,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:21,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:21,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:21,089 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:21,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:21,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:21,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:21,092 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:21,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:21,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:21,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:21,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:21,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:21,099 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:21,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:21,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:21,099 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:21,099 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:21,105 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:21,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:21,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:21,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:21,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:21,140 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-28 23:32:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:23,201 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-11-28 23:32:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:23,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-11-28 23:32:23,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 23:32:23,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-11-28 23:32:23,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-11-28 23:32:23,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-11-28 23:32:23,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-11-28 23:32:23,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:23,235 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-11-28 23:32:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-11-28 23:32:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-11-28 23:32:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-28 23:32:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-11-28 23:32:23,297 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 23:32:23,297 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 23:32:23,297 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:32:23,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-11-28 23:32:23,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-11-28 23:32:23,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:23,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:23,300 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:23,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:32:23,301 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-11-28 23:32:23,301 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-11-28 23:32:23,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:32:23,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:23,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:23,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:23,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:23,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-28 23:32:23,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:23,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:23,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:23,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:23,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:23,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-28 23:32:23,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:23,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:23,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:23,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:32:23,790 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-28 23:32:23,832 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:23,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:23,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:23,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:23,833 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:32:23,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:23,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:23,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:23,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 23:32:23,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:23,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:23,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:23,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:23,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:23,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:23,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:23,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:23,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:23,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,128 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 23:32:24,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:24,403 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:24,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:24,414 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:24,414 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:24,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:24,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:24,440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:24,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:24,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:24,465 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:24,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:24,571 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:24,571 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:24,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:24,604 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:24,604 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:24,626 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:24,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:24,681 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:32:24,683 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:24,683 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:24,683 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:24,683 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:24,683 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:32:24,683 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:24,683 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:24,683 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:24,683 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 23:32:24,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:24,684 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:24,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,884 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 23:32:24,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:24,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:25,170 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 23:32:25,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:25,286 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:32:25,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:25,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,296 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,296 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:25,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:25,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,302 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,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-11-28 23:32:25,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,305 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,305 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:25,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:32:25,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:32:25,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,314 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 23:32:25,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,316 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,316 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,318 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,318 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,320 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,320 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,322 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,322 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,325 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,325 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,328 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,328 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,334 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,334 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,338 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,339 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,340 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 23:32:25,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,342 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,342 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,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-11-28 23:32:25,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,345 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,347 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,351 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,352 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,352 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,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-11-28 23:32:25,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,356 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,356 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,357 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,363 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,363 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,368 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,369 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,371 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 23:32:25,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,372 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,372 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,375 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,375 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,376 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:25,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,378 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,378 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,380 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,380 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,383 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,383 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:25,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,388 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,388 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,389 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:25,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,396 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,397 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:32:25,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,402 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,402 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,405 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 23:32:25,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,406 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,410 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,410 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,415 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,415 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,416 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,420 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,420 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,421 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,429 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,429 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,429 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,444 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,444 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,444 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,464 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,465 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,465 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,466 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,485 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,485 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 23:32:25,486 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 23:32:25,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,491 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 23:32:25,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,495 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,496 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,496 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,506 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,506 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,506 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,507 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,513 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,513 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,518 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,520 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,521 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,524 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,532 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,532 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,535 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,552 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,552 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,556 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,558 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,586 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,587 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,591 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,612 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,612 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 23:32:25,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,617 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,624 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 23:32:25,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,625 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,629 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,639 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,642 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,642 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,644 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:25,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,649 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,649 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,649 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,650 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,658 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,670 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,670 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,670 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,675 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:25,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,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-11-28 23:32:25,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,701 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,701 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,701 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,706 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 23:32:25,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,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-11-28 23:32:25,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,738 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,739 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,741 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,754 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,755 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 23:32:25,757 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 23:32:25,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,764 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 23:32:25,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,765 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,769 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,769 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,770 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,773 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,773 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,773 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,780 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,782 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,788 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,789 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,789 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,790 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:32:25,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,798 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,811 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 23:32:25,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 23:32:25,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:32:25,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,818 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 23:32:25,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,819 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,819 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,831 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,831 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,831 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,832 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:25,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,838 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,842 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,848 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,848 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,849 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,864 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,864 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,865 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,866 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:25,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,898 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,899 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:32:25,899 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,903 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:32:25,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,931 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,932 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:32:25,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 23:32:25,968 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 23:32:25,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:32:25,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:32:25,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:32:25,968 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 23:32:25,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:32:25,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:32:25,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:32:25,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:25,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:25,989 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-11-28 23:32:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:27,428 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-11-28 23:32:27,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:27,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-11-28 23:32:27,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 23:32:27,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 23:32:27,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-11-28 23:32:27,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-11-28 23:32:27,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-11-28 23:32:27,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:27,446 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 23:32:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-11-28 23:32:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-11-28 23:32:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-28 23:32:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 23:32:27,473 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 23:32:27,473 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 23:32:27,473 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:32:27,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-11-28 23:32:27,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 23:32:27,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:27,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:27,478 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:27,478 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-11-28 23:32:27,478 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-11-28 23:32:27,480 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-11-28 23:32:27,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 23:32:27,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:27,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:27,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-28 23:32:27,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:27,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:27,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:27,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:27,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:32:27,817 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:27,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:32:27,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:32:27,820 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-11-28 23:32:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:29,718 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-11-28 23:32:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:32:29,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-11-28 23:32:29,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-11-28 23:32:29,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-11-28 23:32:29,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-11-28 23:32:29,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-11-28 23:32:29,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-11-28 23:32:29,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:29,744 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-11-28 23:32:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-11-28 23:32:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-11-28 23:32:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-11-28 23:32:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-11-28 23:32:29,794 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 23:32:29,794 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 23:32:29,794 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:32:29,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-11-28 23:32:29,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-11-28 23:32:29,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:29,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:29,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:29,806 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-11-28 23:32:29,807 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-11-28 23:32:29,808 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-11-28 23:32:29,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-28 23:32:29,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:29,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:29,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-28 23:32:29,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:29,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:29,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:29,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:29,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:32:29,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:29,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:32:29,922 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:29,923 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-11-28 23:32:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:30,832 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-11-28 23:32:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:30,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:30,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:30,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 23:32:30,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-11-28 23:32:30,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-11-28 23:32:30,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:30,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:30,864 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 23:32:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-11-28 23:32:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-11-28 23:32:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 23:32:30,893 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 23:32:30,893 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 23:32:30,893 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:32:30,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-11-28 23:32:30,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:30,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:30,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:30,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:30,910 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-11-28 23:32:30,910 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-11-28 23:32:30,911 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-11-28 23:32:30,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-28 23:32:30,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:30,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:30,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:30,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-28 23:32:30,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:30,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:30,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:32:31,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:31,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:32:31,047 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:31,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:31,051 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-11-28 23:32:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:32,145 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-11-28 23:32:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:32,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:32,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:32,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 23:32:32,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-11-28 23:32:32,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-11-28 23:32:32,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:32,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:32,167 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 23:32:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-11-28 23:32:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-11-28 23:32:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 23:32:32,187 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 23:32:32,187 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 23:32:32,187 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:32:32,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-11-28 23:32:32,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 23:32:32,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:32,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:32,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:32,195 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-11-28 23:32:32,196 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-11-28 23:32:32,196 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-11-28 23:32:32,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-28 23:32:32,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:32,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:32,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:32,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:32,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:32,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-28 23:32:32,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:32,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:32:32,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:32,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:32,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:32:32,446 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:32:32,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:32:32,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:32:32,447 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-11-28 23:32:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:33,574 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-11-28 23:32:33,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:32:33,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:33,582 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 23:32:33,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 23:32:33,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-11-28 23:32:33,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-11-28 23:32:33,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:33,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:33,594 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 23:32:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-11-28 23:32:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-11-28 23:32:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 23:32:33,613 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 23:32:33,613 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 23:32:33,613 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:32:33,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-11-28 23:32:33,619 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 23:32:33,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:33,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:33,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:32:33,621 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-11-28 23:32:33,623 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-11-28 23:32:33,625 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-11-28 23:32:33,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-28 23:32:33,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:33,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:33,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:33,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:33,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:33,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:33,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-28 23:32:33,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:33,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:33,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-28 23:32:33,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:33,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:33,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:32:33,992 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:32:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:32:34,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:32:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 23:32:36,051 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-28 23:32:36,193 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-28 23:32:36,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:32:36,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:32:36,214 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-11-28 23:32:37,011 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-28 23:32:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:32:37,561 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-11-28 23:32:37,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:32:37,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-11-28 23:32:37,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 23:32:37,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-11-28 23:32:37,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-11-28 23:32:37,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-11-28 23:32:37,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-11-28 23:32:37,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:32:37,590 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 23:32:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-11-28 23:32:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-11-28 23:32:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-11-28 23:32:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-11-28 23:32:37,608 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 23:32:37,608 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 23:32:37,608 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:32:37,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-11-28 23:32:37,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 23:32:37,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:32:37,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:32:37,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:32:37,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:32:37,615 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-11-28 23:32:37,615 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-11-28 23:32:37,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-28 23:32:37,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:37,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:37,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:37,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-28 23:32:37,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:37,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:37,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:37,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:32:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-28 23:32:37,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:32:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:32:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:37,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:32:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:32:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:32:37,845 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-11-28 23:32:38,002 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-28 23:32:38,053 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:32:38,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:32:38,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:32:38,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:32:38,054 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:32:38,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:32:38,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:32:38,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label19_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-28 23:32:38,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:32:38,055 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:32:38,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,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-11-28 23:32:38,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-11-28 23:32:38,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-11-28 23:32:38,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,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-11-28 23:32:38,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:32:38,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:32:38,519 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,531 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,531 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,552 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,555 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,555 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,602 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,602 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,607 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,607 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,631 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,633 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,655 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,658 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,658 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,682 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,697 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,722 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,722 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,745 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,767 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,770 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,770 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:38,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,793 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,798 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,819 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,822 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,845 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,845 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,867 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,874 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,874 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,899 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,899 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:38,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:38,922 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:38,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:38,944 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:38,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:38,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:39,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:39,209 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:39,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:39,229 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:39,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:39,232 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:39,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:39,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:39,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:39,255 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:39,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:39,276 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:32:39,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:32:39,301 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:39,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:39,486 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:39,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:39,507 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:39,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:39,510 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:32:39,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:32:39,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:32:39,541 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:32:39,541 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-28 23:32:39,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:32:39 BoogieIcfgContainer [2018-11-28 23:32:39,595 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:32:39,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:32:39,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:32:39,599 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:32:39,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:32:16" (3/4) ... [2018-11-28 23:32:39,605 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:32:39,681 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:32:39,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:32:39,682 INFO L168 Benchmark]: Toolchain (without parser) took 27673.24 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 440.4 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -267.6 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:39,685 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:32:39,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:39,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -220.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:39,689 INFO L168 Benchmark]: Boogie Preprocessor took 88.82 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:39,689 INFO L168 Benchmark]: RCFGBuilder took 3573.88 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: 98.6 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:39,690 INFO L168 Benchmark]: BuchiAutomizer took 22930.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -184.8 MB). Peak memory consumption was 490.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:32:39,690 INFO L168 Benchmark]: Witness Printer took 85.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:32:39,701 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 804.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 184.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -220.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.82 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3573.88 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: 98.6 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22930.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -184.8 MB). Peak memory consumption was 490.2 MB. Max. memory is 11.5 GB. * Witness Printer took 85.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 12.3s. Construction of modules took 8.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s 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, 8.2s 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: 116ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - 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@6af9458f=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3261bd38=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@6af9458f=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3261bd38=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@6af9458f=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@3261bd38=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...