./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label27_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label27_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 571733b9b2b4edd3beb90cbc1a974d2015477291 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:37:14,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:37:14,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:37:14,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:37:14,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:37:14,943 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:37:14,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:37:14,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:37:14,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:37:14,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:37:14,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:37:14,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:37:14,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:37:14,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:37:14,948 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:37:14,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:37:14,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:37:14,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:37:14,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:37:14,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:37:14,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:37:14,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:37:14,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:37:14,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:37:14,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:37:14,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:37:14,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:37:14,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:37:14,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:37:14,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:37:14,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:37:14,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:37:14,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:37:14,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:37:14,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:37:14,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:37:14,958 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 01:37:14,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:37:14,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:37:14,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 01:37:14,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 01:37:14,970 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 01:37:14,970 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 01:37:14,970 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 01:37:14,970 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 01:37:14,970 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 01:37:14,971 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 01:37:14,971 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 01:37:14,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:37:14,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:37:14,971 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 01:37:14,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:37:14,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:37:14,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:37:14,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 01:37:14,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 01:37:14,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 01:37:14,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:37:14,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:37:14,972 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 01:37:14,973 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:37:14,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 01:37:14,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:37:14,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:37:14,973 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 01:37:14,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:37:14,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 01:37:14,974 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 01:37:14,974 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 01:37:14,975 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 571733b9b2b4edd3beb90cbc1a974d2015477291 [2018-12-02 01:37:14,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:37:15,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:37:15,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:37:15,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:37:15,008 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:37:15,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label27_true-unreach-call_false-termination.c [2018-12-02 01:37:15,044 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/data/16d3ef93c/12fba33770354a3c96298efe60180f07/FLAGa7882fc20 [2018-12-02 01:37:15,436 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:37:15,437 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/sv-benchmarks/c/eca-rers2012/Problem02_label27_true-unreach-call_false-termination.c [2018-12-02 01:37:15,443 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/data/16d3ef93c/12fba33770354a3c96298efe60180f07/FLAGa7882fc20 [2018-12-02 01:37:15,792 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/data/16d3ef93c/12fba33770354a3c96298efe60180f07 [2018-12-02 01:37:15,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:37:15,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:37:15,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:37:15,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:37:15,809 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:37:15,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:37:15" (1/1) ... [2018-12-02 01:37:15,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b2985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:15, skipping insertion in model container [2018-12-02 01:37:15,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:37:15" (1/1) ... [2018-12-02 01:37:15,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:37:15,843 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:37:16,021 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:37:16,024 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:37:16,126 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:37:16,138 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:37:16,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16 WrapperNode [2018-12-02 01:37:16,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:37:16,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:37:16,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:37:16,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:37:16,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:37:16,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:37:16,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:37:16,189 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:37:16,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... [2018-12-02 01:37:16,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:37:16,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:37:16,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:37:16,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:37:16,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:16,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:37:16,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:37:16,812 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:37:16,812 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 01:37:16,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:37:16 BoogieIcfgContainer [2018-12-02 01:37:16,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:37:16,814 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 01:37:16,814 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 01:37:16,816 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 01:37:16,817 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:37:16,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 01:37:15" (1/3) ... [2018-12-02 01:37:16,818 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4103f6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:37:16, skipping insertion in model container [2018-12-02 01:37:16,818 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:37:16,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:37:16" (2/3) ... [2018-12-02 01:37:16,819 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4103f6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 01:37:16, skipping insertion in model container [2018-12-02 01:37:16,819 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 01:37:16,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:37:16" (3/3) ... [2018-12-02 01:37:16,821 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label27_true-unreach-call_false-termination.c [2018-12-02 01:37:16,866 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 01:37:16,866 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 01:37:16,866 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 01:37:16,867 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 01:37:16,867 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:37:16,867 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:37:16,867 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 01:37:16,867 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:37:16,867 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 01:37:16,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-02 01:37:16,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-02 01:37:16,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:16,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:16,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:16,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 01:37:16,914 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 01:37:16,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-02 01:37:16,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-02 01:37:16,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:16,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:16,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:16,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 01:37:16,929 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-12-02 01:37:16,930 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-12-02 01:37:16,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 01:37:16,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:16,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:16,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:16,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:16,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:16,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-02 01:37:16,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:16,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:17,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:17,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:17,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:17,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-02 01:37:17,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:17,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:17,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:17,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:17,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:37:17,170 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:37:17,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:37:17,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:37:17,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:37:17,171 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 01:37:17,172 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,172 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:37:17,172 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:37:17,172 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-02 01:37:17,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:37:17,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:37:17,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,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-12-02 01:37:17,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:37:17,383 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,386 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:17,393 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,413 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:17,413 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:17,435 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:17,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:17,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:17,494 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:17,513 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:17,528 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 01:37:17,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:17,576 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 01:37:17,577 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:37:17,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:37:17,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:37:17,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:37:17,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:37:17,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:17,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:37:17,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:37:17,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-02 01:37:17,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:37:17,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:37:17,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:17,747 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:37:17,751 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:37:17,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:17,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:17,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,766 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:17,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:17,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,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-12-02 01:37:17,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:17,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:17,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:17,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:17,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,795 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:17,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:17,796 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:17,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,799 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 01:37:17,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,801 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,801 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,808 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,808 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,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-12-02 01:37:17,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,811 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:17,811 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,812 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 01:37:17,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,824 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,824 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,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-12-02 01:37:17,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,828 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,829 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,831 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,831 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,834 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,835 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,836 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:17,836 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:17,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,840 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 01:37:17,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-12-02 01:37:17,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:17,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,866 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:17,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,871 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:17,871 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,872 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 01:37:17,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:17,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,893 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:17,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,897 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:17,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,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-12-02 01:37:17,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,900 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:17,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:17,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:17,903 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:17,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,907 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 01:37:17,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,909 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:17,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,916 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,917 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:17,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,920 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:17,920 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,921 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 01:37:17,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,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-12-02 01:37:17,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,935 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:17,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,940 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:17,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,943 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,944 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:17,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,947 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:17,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:17,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,949 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:17,949 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:17,950 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:17,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,954 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 01:37:17,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-12-02 01:37:17,954 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:17,955 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:17,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,955 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,956 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,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-12-02 01:37:17,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:17,968 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:17,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,968 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:17,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:17,971 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:17,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,971 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:17,972 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:17,973 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 01:37:17,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:17,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:17,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:17,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:17,998 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:17,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:17,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:17,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:17,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:18,000 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:18,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,004 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:18,005 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:18,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,008 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:18,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:18,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,012 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,012 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:18,013 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:18,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,014 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,014 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:18,014 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:18,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:18,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,019 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-02 01:37:18,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,019 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,020 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,022 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,031 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,034 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,035 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:18,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,036 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 01:37:18,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,055 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,060 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,063 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,063 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,067 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,067 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,069 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:18,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,069 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:18,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,071 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:18,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,078 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-02 01:37:18,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,079 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,080 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:18,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,088 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,088 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,089 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:18,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,093 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:18,093 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,096 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 01:37:18,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,122 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,122 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,124 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:18,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,128 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,129 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,129 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:18,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,133 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,133 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,133 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:18,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,137 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,137 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,137 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:18,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,139 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,139 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:18,139 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:18,140 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:18,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,146 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-02 01:37:18,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,147 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,148 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,155 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,155 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,158 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:18,158 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,160 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 01:37:18,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,170 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,170 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,171 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,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-12-02 01:37:18,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,175 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:18,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:18,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,181 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:18,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:18,182 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:18,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,186 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-02 01:37:18,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,187 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,187 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:18,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,208 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,208 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:18,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,211 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,211 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,211 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 01:37:18,211 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,213 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-02 01:37:18,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,262 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,262 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:18,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,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-12-02 01:37:18,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,271 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,272 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:18,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,274 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,275 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,275 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:18,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,277 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:18,278 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:18,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:18,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:18,280 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:18,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:18,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:18,280 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:18,280 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:18,281 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 01:37:18,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:18,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:37:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:37:18,297 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-02 01:37:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:18,734 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-02 01:37:18,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:37:18,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-02 01:37:18,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-02 01:37:18,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-02 01:37:18,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-02 01:37:18,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-02 01:37:18,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-02 01:37:18,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:37:18,747 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-02 01:37:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-02 01:37:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-02 01:37:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-02 01:37:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-02 01:37:18,774 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-02 01:37:18,774 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-02 01:37:18,774 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 01:37:18,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-02 01:37:18,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-02 01:37:18,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:18,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:18,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:18,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:18,776 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-12-02 01:37:18,776 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-12-02 01:37:18,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 01:37:18,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:18,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:18,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:18,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:18,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-02 01:37:18,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:18,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:18,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:18,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:37:18,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:18,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:18,792 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-02 01:37:18,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:18,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:18,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:18,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:18,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:18,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 01:37:18,906 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:37:18,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:37:18,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:37:18,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:37:18,907 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 01:37:18,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:18,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:37:18,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:37:18,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-02 01:37:18,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:37:18,907 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:37:18,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:18,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:18,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:18,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:18,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:18,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:18,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-12-02 01:37:18,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,010 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:37:19,010 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:19,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:19,014 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:19,015 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:19,030 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:19,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:19,033 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:19,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:19,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:19,050 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:19,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:19,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:19,067 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:19,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:19,084 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:19,084 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:19,101 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 01:37:19,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:19,138 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 01:37:19,140 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:37:19,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:37:19,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:37:19,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:37:19,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 01:37:19,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:19,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:37:19,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:37:19,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-02 01:37:19,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:37:19,140 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:37:19,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,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-12-02 01:37:19,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:19,251 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:37:19,251 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 01:37:19,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:19,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,254 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,255 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:19,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:19,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,258 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,259 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,261 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:19,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 01:37:19,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 01:37:19,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,316 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 01:37:19,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,316 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,316 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,318 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,318 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,319 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,319 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,320 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,320 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,321 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,321 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,323 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,323 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,326 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,326 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,328 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,329 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,330 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 01:37:19,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,331 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,332 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,333 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,333 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,334 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,334 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,335 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,335 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,336 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,336 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,337 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,339 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,339 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,339 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,342 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,342 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,345 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,346 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 01:37:19,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-12-02 01:37:19,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,346 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,347 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,348 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,348 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:19,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,349 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,350 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,351 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,351 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,352 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,352 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,353 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:19,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,355 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,355 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,355 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:19,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,359 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,359 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 01:37:19,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,362 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,362 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,363 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 01:37:19,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,364 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,364 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,364 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,366 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,366 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,366 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,367 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,368 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,368 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,369 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,369 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,369 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,370 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,371 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,371 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,374 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,374 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,374 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,378 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,379 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,379 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,383 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,383 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,383 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 01:37:19,383 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 01:37:19,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,385 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-02 01:37:19,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,385 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,386 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,386 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,388 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,388 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,388 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,389 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,390 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,390 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,391 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,392 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,394 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,394 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,394 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,398 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,398 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,398 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,399 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,405 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,406 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,406 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,410 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 01:37:19,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,410 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,410 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,412 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-02 01:37:19,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,413 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,413 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,413 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,416 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,416 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,416 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,417 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:19,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,418 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,418 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,418 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,418 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,419 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,420 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,420 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,422 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,423 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,423 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,423 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:19,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,428 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,429 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,429 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,430 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 01:37:19,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,440 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,441 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,446 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,446 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 01:37:19,447 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 01:37:19,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,450 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-02 01:37:19,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,451 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,452 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,453 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,453 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,454 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,454 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,454 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,456 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,456 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,458 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,458 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,458 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,461 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,461 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,461 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,461 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,462 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 01:37:19,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,466 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,466 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,466 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,466 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,471 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,471 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 01:37:19,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,471 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 01:37:19,471 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 01:37:19,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,473 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-02 01:37:19,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,473 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,474 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,474 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,476 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,476 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,476 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,476 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 01:37:19,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,478 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,478 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,478 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,480 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,480 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,482 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,482 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,483 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,483 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,483 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 01:37:19,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,490 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,490 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 01:37:19,490 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,491 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 01:37:19,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,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-12-02 01:37:19,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,501 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,502 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 01:37:19,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 01:37:19,512 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 01:37:19,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 01:37:19,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 01:37:19,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 01:37:19,512 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 01:37:19,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 01:37:19,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 01:37:19,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 01:37:19,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:37:19,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:37:19,516 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-02 01:37:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:19,807 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-02 01:37:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:37:19,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-02 01:37:19,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-02 01:37:19,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-02 01:37:19,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-02 01:37:19,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-02 01:37:19,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-02 01:37:19,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:37:19,817 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-02 01:37:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-02 01:37:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-02 01:37:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-02 01:37:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-02 01:37:19,833 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-02 01:37:19,833 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-02 01:37:19,833 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 01:37:19,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-02 01:37:19,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-02 01:37:19,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:19,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:19,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:19,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:19,837 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-12-02 01:37:19,837 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-12-02 01:37:19,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:19,838 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-02 01:37:19,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:19,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:19,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:19,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:19,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:19,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-02 01:37:19,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:19,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:37:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:19,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:19,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:37:19,898 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 01:37:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:37:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:37:19,898 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-02 01:37:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:20,358 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-02 01:37:20,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:37:20,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-02 01:37:20,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-02 01:37:20,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-02 01:37:20,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-02 01:37:20,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-02 01:37:20,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-02 01:37:20,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:37:20,367 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-02 01:37:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-02 01:37:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-02 01:37:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-02 01:37:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-02 01:37:20,378 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-02 01:37:20,378 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-02 01:37:20,378 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 01:37:20,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-02 01:37:20,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-02 01:37:20,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:20,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:20,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:20,382 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:20,382 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-12-02 01:37:20,382 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-12-02 01:37:20,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-02 01:37:20,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:20,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:20,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:20,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:20,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-02 01:37:20,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:20,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:20,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:37:20,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 01:37:20,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:20,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:37:20,399 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 01:37:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:37:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:37:20,399 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-02 01:37:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:20,723 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-02 01:37:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:37:20,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-02 01:37:20,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 01:37:20,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-02 01:37:20,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-02 01:37:20,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-02 01:37:20,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-02 01:37:20,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:37:20,731 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-02 01:37:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-02 01:37:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-02 01:37:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-02 01:37:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-02 01:37:20,742 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-02 01:37:20,742 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-02 01:37:20,742 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 01:37:20,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-02 01:37:20,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 01:37:20,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:20,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:20,746 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:20,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:20,746 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-12-02 01:37:20,746 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-12-02 01:37:20,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-02 01:37:20,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:20,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:20,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-02 01:37:20,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:20,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:37:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 01:37:20,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:20,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:37:20,776 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 01:37:20,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:37:20,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:37:20,776 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-02 01:37:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:21,018 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-02 01:37:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:37:21,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-02 01:37:21,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 01:37:21,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-02 01:37:21,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-02 01:37:21,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-02 01:37:21,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-02 01:37:21,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:37:21,030 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-02 01:37:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-02 01:37:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-02 01:37:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-02 01:37:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-02 01:37:21,044 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-02 01:37:21,044 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-02 01:37:21,044 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 01:37:21,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-02 01:37:21,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 01:37:21,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:21,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:21,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:21,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:21,050 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-12-02 01:37:21,050 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-12-02 01:37:21,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-02 01:37:21,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:21,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:21,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:21,055 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-02 01:37:21,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:21,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:37:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:21,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:21,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:37:21,090 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 01:37:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:37:21,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:37:21,090 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-02 01:37:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:21,233 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-02 01:37:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:37:21,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-02 01:37:21,236 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-02 01:37:21,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-02 01:37:21,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-02 01:37:21,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-02 01:37:21,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-02 01:37:21,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:37:21,240 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-02 01:37:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-02 01:37:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-02 01:37:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-02 01:37:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-02 01:37:21,250 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-02 01:37:21,250 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-02 01:37:21,250 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 01:37:21,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-02 01:37:21,252 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-02 01:37:21,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:21,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:21,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 01:37:21,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:21,253 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-12-02 01:37:21,254 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-12-02 01:37:21,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-02 01:37:21,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:21,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:21,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-02 01:37:21,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:21,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:21,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:21,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:21,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-02 01:37:21,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:21,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:21,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:21,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:21,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:37:21,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 01:37:22,282 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-02 01:37:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 01:37:22,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:37:22,343 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-02 01:37:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:22,816 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-02 01:37:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:37:22,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-02 01:37:22,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-02 01:37:22,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-02 01:37:22,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-02 01:37:22,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-02 01:37:22,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-02 01:37:22,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 01:37:22,823 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-02 01:37:22,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-02 01:37:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-02 01:37:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-02 01:37:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-02 01:37:22,833 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-02 01:37:22,833 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-02 01:37:22,833 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 01:37:22,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-02 01:37:22,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-02 01:37:22,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 01:37:22,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 01:37:22,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 01:37:22,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:22,837 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-12-02 01:37:22,837 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-12-02 01:37:22,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-02 01:37:22,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:22,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:22,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-02 01:37:22,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:22,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:22,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:22,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:22,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:22,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-02 01:37:22,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 01:37:22,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 01:37:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:22,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:37:22,983 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 01:37:22,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 01:37:22,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 01:37:22,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 01:37:22,983 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 01:37:22,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:22,983 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 01:37:22,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 01:37:22,983 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label27_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-02 01:37:22,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 01:37:22,983 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 01:37:22,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:22,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 01:37:23,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 01:37:23,147 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,152 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,188 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,190 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,190 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,208 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,223 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,225 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,242 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,243 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,259 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,259 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,274 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,274 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,276 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,293 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,308 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,309 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,309 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,326 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,326 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,360 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,360 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,377 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,377 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,406 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,406 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,408 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,408 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,423 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 01:37:23,443 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,592 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,608 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,625 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,639 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 01:37:23,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,789 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,789 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,804 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,806 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 01:37:23,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 01:37:23,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 01:37:23,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 01:37:23,822 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-02 01:37:23,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 01:37:23 BoogieIcfgContainer [2018-12-02 01:37:23,853 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 01:37:23,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:37:23,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:37:23,853 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:37:23,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:37:16" (3/4) ... [2018-12-02 01:37:23,855 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-02 01:37:23,882 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bd0c46b4-c7b6-4144-8a4e-0c3aba1a58cd/bin-2019/uautomizer/witness.graphml [2018-12-02 01:37:23,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:37:23,883 INFO L168 Benchmark]: Toolchain (without parser) took 8084.49 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 444.6 MB). Free memory was 944.2 MB in the beginning and 1.3 GB in the end (delta: -362.9 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:23,883 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:37:23,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:23,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:23,884 INFO L168 Benchmark]: Boogie Preprocessor took 39.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:23,884 INFO L168 Benchmark]: RCFGBuilder took 584.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.1 MB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:23,884 INFO L168 Benchmark]: BuchiAutomizer took 7039.08 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 346.0 MB). Free memory was 962.1 MB in the beginning and 1.3 GB in the end (delta: -345.0 MB). Peak memory consumption was 535.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:37:23,884 INFO L168 Benchmark]: Witness Printer took 29.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:37:23,886 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 584.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.1 MB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7039.08 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 346.0 MB). Free memory was 962.1 MB in the beginning and 1.3 GB in the end (delta: -345.0 MB). Peak memory consumption was 535.5 MB. Max. memory is 11.5 GB. * Witness Printer took 29.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 6.9s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. Construction of modules took 1.7s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s 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: 50ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ae4e969=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1818ace5=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@1ae4e969=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1818ace5=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@1ae4e969=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@1818ace5=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...